From discrepancy to declustering: Near-optimal multidimensional declustering strategies for range queries

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2002, Pages 29-38

  Chen, Chung Min ^a   Cheng, Christine T ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA PROCESSING; DATABASE SYSTEMS; ERROR ANALYSIS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; POLYNOMIALS; REMOTE SENSING; RESPONSE TIME (COMPUTER SYSTEMS);

ADDITIVE ERRORS; DECLUSTERING SCHEMES; PARALLEL RETRIEVAL;

INFORMATION RETRIEVAL;

EID: 0036041755     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (35)

1. Optimal allocation of two-dimensional data
2. (Almost) optimal parallel block access for range queries
3. Declustering using golden ratio sequences
4. Hierarchical declustering schemes for range queries
5. Titan: A high-performance remote-sensing database
6. Analysis and comparison of declustering schemes for interactive navigation queries
7. Efficient disk allocation schemes for parallel retrieval of multidimensional grid data
8. Declustering objects for visualization
9. Disk allocation for cartesian product files on multiple disk systems
10. Gray codes for partial match and range queries
11. Declustering using fractals
12. The idea of declustering and its applications
13. Discrepancy of sequences associated with a number system (in dimension s) (in french)
14. Dealing with the data deluge
15. On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
16. Latin hypercubes: A class of multidimensional declustering techniques
17. Optimal file distribution for partial match retrieval
18. New GDM-based declustering methods for parallel range queries
19. CMD: A multidimensional declustering method for parallel database systems
20. Partitioning similarity graphs: A framework for declustering problems
21. Scalability analysis of declustering methods for multidimensional range queries
22. Nets, (t,s) sequences, and algebraic curves over finite fields with many rational points
23. Efficient retrieval of multidimensional datasets through parallel I/O
24. Cyclic allocation of two-dimensional data
25. On irregularities of distribution
26. On irregularities of distribution vii
27. Asymptotically optimal declustering schemes for range queries
28. Data declustering in PADMA: A parallel database manager
29. Disk allocation methods for parallelizing grid files