Space-efficient range reporting for categorical data

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

Volumn , Issue , 2012, Pages 113-119

  Nekrich, Yakov ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

colored range reporting; data structures; orthogonal range reporting

Indexed keywords

BLOCK SIZES; CATEGORICAL DATA; COLORED RANGE REPORTING; EXTERNAL MEMORY MODELS; ORTHOGONAL RANGE REPORTING; SPACE USAGE;

QUERY PROCESSING; TWO DIMENSIONAL;

DATA STRUCTURES;

EID: 84862632965     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213556.2213575     Document Type: Conference Paper

References (28)

1. A. Aggarwal and J. S. Vitter, The Input/Output Complexity of Sorting and Related Problems, Communications of the ACM (CACM), 31(9), 1116-1127, 1988. (Pubitemid 18662481)
2. P. Agarwal, S. Govindarajan, S. Muthukrishnan, Range Searching in Categorical Data: Colored Range Searching on Grid, Proc. 10th European Symp. on Algorithms (ESA) 2002, 17-28.
3. L. Arge, V. Samoladas, J. S. Vitter, On Two-Dimensional Indexability and Optimal Range Search Indexing, Proc. 18th ACM Symp. on Principles of Database Systems (PODS) 1999, 346-357.
4. B. Becker, S. Gschwind, T. Ohler, B. Seeger, and P. Widmayer, An Asymptotically Optimal Multiversion B-Tree, VLDB Journal, 5(4), 264-275, 1996. (Pubitemid 126704142)
5. J. L. Bentley, Multidimensional Divide-and-Conquer, Commun. ACM 23, 214-229, 1980.
6. P. Bozanis, N. Kitsios, C. Makris, A.-K. Tsakalidis, New Upper Bounds for Generalized Intersection Searching Problems, Proc. 22nd Int. Colloquium on Automata, Languages and Programming (ICALP), 1995, 464-474.
7. P. Bozanis, N. Kitsios, C. Makris, A.-K. Tsakalidis, New Results on Intersection Query Problems, Computer Journal 40(1), 22-29 (1997).
8. B. Chazelle, A Functional Approach to Data Structures and Its Use in Multidimensional Searching, SIAM Journal on Computing 17(3), 427-462, 1988.
9. J. R. Driscoll, N. Sarnak, D. D. Sleator, R. E. Tarjan, Making Data Structures Persistent, J. Comput. Syst. Sci. 38(1), 86-124 (1989).
10. H. N. Gabow, J. L. Bentley, R. E. Tarjan, Scaling and Related Techniques for Geometry Problems, Proc. 16th ACM Symp. on Theory of Computing (STOC) 1984, 135-143.
11. T. Gagie, G. Navarro, and S. J. Puglisi, Colored Range Queries and Document Retrieval, Proc. 17th Int. Symp. on String Processing and Information Retrieval (SPIRE) 2010, 67-81.
12. P. Gupta, R. Janardan, M. Smid, Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization, Journal of Algorithms 19(2), 282-317, 1995.
13. P. Gupta, R. Janardan, and M. Smid, Efficient Algorithms for Generalized Intersection Searching on Non-Iso-oriented Objects, Computational Geometry: Theory & Applications 6(1), 1-19, 1996. (Pubitemid 126375588)
14. R. Janardan, M. Lopez, Generalized Intersection Searching Problems, Internat. J. Comput. Geom. Appl. 3, 39-69, 1993.
15. H. Kaplan, Persistent Data Structures, In Handbook on Data Structures and Applications, D. Mehta and S. Sahni, editors, CRC Press, 2005.
16. M. Karpinski and Y. Nekrich, Searching for Frequent Colors in Rectangles, Proc. Canadian Conf. on Computational Geometry (CCCG) 2008.
17. M. Karpinski and Y. Nekrich, Top-K Color Queries for Document Retrieval, Proc. 22nd ACM-SIAM Symp. on Discrete Algorithms (SODA) 2011, 401-411.
18. G. Navarro, Y. Nekrich, Top-k Document Retrieval in Optimal Time and Linear Space, Proc. 23rd ACM-SIAM Symp. on Discrete Algorithms (SODA) 2012, 1066-1077.
19. K. G. Larsen, R. Pagh, I/O-Efficient Data Structures for Colored Range and Pre x Reporting, Proc. 23rd ACM-SIAM Symp. on Discrete Algorithms (SODA) 2012, to appear.
20. S. Muthukrishnan, Efficient Algorithms for Document Retrieval Problems, Proc. 13th ACM-SIAM Symp. on Discrete Algorithms (SODA) 2002, 657-666.
21. E. M. McCreight, Priority Search Trees, SIAM Journal on Computing 14(2), 257-276, 1985.
22. A. Nanopoulos, P. Bozanis, Categorical Range Queires in Large Databases, Proc. 8th Int. Symp. on Advances in Spatial and Temporal Databases (SSTD) 2003, 122-139.
23. Y. Nekrich, External Memory Range Reporting on a Grid, Proc. 18th Int. Symp. on Algorithms and Computation (ISAAC) 2007, 525-535.
24. Y. Nekrich, External Memory Orthogonal Range Reporting with Fast Updates, Proc. 22nd Int. Symp. on Algorithms and Computation (ISAAC) 2011, 395-404.
25. M. Pǎtraşcu, M. Thorup, Time-space Trade-o s for Predecessor Search, Proc. 38th ACM Symp. on Theory of Computing (STOC) 2006, 232-240.
26. S. Ramaswamy, S. Subramanian, Path Caching: A Technique for Optimal External Searching, Proc. 13th ACM Symp. on Principles of Database Systems (PODS) 1994, 25-35.
27. S. Subramanian, S. Ramaswamy, The P-range Tree: A New Data Structure for Range Searching in Secondary Memory, Proc. 6th ACM-SIAM Symp. on Discrete Algorithms (SODA) 1995, 378-387.
28. P. J. Varman, R. M. Verma, An Efficient Multiversion Access Structure, IEEE Transactions on Knowledge and Data Engineering, 9(3), 391-409, 1997.