Some properties of optimal cartesian product files for orthogonal range queries

DOI10.1016/0020-0255(95)00284-7zbMATH Open0881.68047OpenAlexW2056707262MaRDI QIDQ1369170FDOQ1369170

Authors: Annie Y. H. Chou, Wei-Pang Yang, Chin-Chen Chang 

Publication date: 25 February 1998

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(95)00284-7

Recommendations

• New Data Structures for Orthogonal Range Queries
• Space-Time Trade-Offs for Orthogonal Range Queries
• Efficient top-\(k\) queries for orthogonal ranges
• Compact and succinct data structures for multidimensional orthogonal range searching
• Optimal multiple key hashing files for orthogonal range queries
• On the average performance of orthogonal range search in multidimensional data structures
• scientific article; zbMATH DE number 2086648
• Succinct indices for range queries with applications to orthogonal range maxima
• Orthogonal range reporting, query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
• Algorithms - ESA 2003

zbMATH Keywords

partial match queriesCartesian product file

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Cites Work

• Partial-Match Retrieval Algorithms
• Optimal MMI file systems for orthogonal range retrieval
• Multi-dimensional clustering for data base organizations
• Performance Analyses of Cartesian Product Files and Random Files
• Common Properties of Some Multiattribute File Systems
• Optimal information retrieval when queries are not random

Cited In (1)

• Optimal MMI file systems for orthogonal range retrieval

This page was built for publication: Some properties of optimal cartesian product files for orthogonal range queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1369170)