Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chou, AYH | en_US |
dc.contributor.author | Yang, WP | en_US |
dc.contributor.author | Chang, CC | en_US |
dc.date.accessioned | 2014-12-08T15:02:43Z | - |
dc.date.available | 2014-12-08T15:02:43Z | - |
dc.date.issued | 1996-04-01 | en_US |
dc.identifier.issn | 0020-0255 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/1354 | - |
dc.description.abstract | Cartesian product file (CPF) has bren proposed as a good multi-attribute file structure. Although designing an optimal CPF for partial match queries (PMQs) has been proven to be NP-hard, some useful properties have been studied for PMQs to help the work. However, a good CPF for PMQs may not be beneficial for orthogonal range queries (ORQs). Therefore, in this paper, we intend to study properties that help the design of a good CPF for ORQs. We found that the problem of designing the optimal CPF for ORQs is related to the problem of finding a minimal-f N-tuple. We will also show some theories of minimal-f N-tuples and develop a method for generating a minimal-f N-tuple. Finally, we will present some properties of the optimal CPF for ORQs from the theories of minimal-f N-tuples. | en_US |
dc.language.iso | en_US | en_US |
dc.title | Some properties of optimal Cartesian product files for orthogonal range queries | en_US |
dc.type | Article | en_US |
dc.identifier.journal | INFORMATION SCIENCES | en_US |
dc.citation.volume | 90 | en_US |
dc.citation.issue | 1-4 | en_US |
dc.citation.spage | 91 | en_US |
dc.citation.epage | 107 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
Appears in Collections: | Articles |
Files in This Item:
If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.