Range searching in categorical data: Colored range searching on grid

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2461, Issue , 2002, Pages 17-28

  Agarwal, Pankaj K ^a   Govindarajan, Sathish ^a   Muthukrishnan, S ^b  

^a Duke University   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; DATA STRUCTURES;

CATEGORICAL DATA; EFFICIENT DATA STRUCTURES; ENCLOSURE PROBLEM; GEOMETRIC OBJECTS; LINEAR SPACES; QUERY OBJECT; RANGE SEARCHING; SPATIAL DATABASE;

QUERY PROCESSING;

EID: 84938097887     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45749-6_6     Document Type: Conference Paper

References (18)

1. P. K. Agarwal and J. Erickson. Geometric range searching and its relatives. In B. Chazelle, J. E. Goodman, and R. Pollack, editors, pages 1–56. American Mathematical Society, Providence, RI, 1999. 17
2. A.V. Aho, J. E. Hopcroft, and J. D. Ullman. Data Structures and Algorithms. Addison Wesley Press, 1983. 21
3. S. Alstrup, G. Brodal, and T. Rauhe. New data structures for ortogonal range searching. In Proc. 41th Annual IEEE Symp. Foundations of Comp. Sci., pages 198–207, 2000. 20
4. J. L. Bentley. Multidimensional divide-and-conquer. Commun. ACM, 23(4):214–229, 1980. 20
5. B. Chazelle. Filtering search: A new approach to query-answering. SIAM J. Comput., 15(3):703–724, 1986. 20
6. B. Chazelle. A functional approach to data structures and its use in multidimensional searching. SIAM J. Comput., 17(3):427–462, June 1988. 20
7. R. Cole and R. Hariharan. Dynamic lca queries. In Proc. 10th Annual Symposium on Discrete Algorithms, pages 235–244, 1999. 22
8. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. M. auf der Heide, H. Rohnert, and R. E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput., 23:738–761, 1994. 22
9. J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan. Making data structures persistent. Journal of Computer and System Sciences, 38:86–124, 1989. 23
10. D. Eppstein and S. Muthukrishnan. Internet packet filter management and rectangle geometry. In Proc. 12th Annual Symp. on Discrete Algorithms, pages 827–835, 2001. 20
11. P. Ferragina, N. Koudas, D. Srivastava, and S. Muthukrishnan. Two-dimensional substring indexing. In Proc. of Intl Conf. on Principles of Database Systems, pages 282–288, 2001. 18
12. M. L. Fredman, J. Komlos, and E. Szemeredi. Storing a sparse table with o(1) worst case access time. J. Assoc. Comput. Mach., 31:538–544, 1984. 21
13. J. Gupta, R. Janardan, and M. Smid. Further results on generalized intersection searching problems: Counting, reporting and dynamization. In Proc. 3rd Workshop on Algorithms and Data structures, pages 237–245, 1993. 20
14. R. Janardan and M. Lopez. Generalized intersection searching problems. J. of Comp. Geom. and Appl., 3:39–70, 1993. 20
15. S. Muthukrishnan. Efficient algorithms for document retrieval problems. In Proc. 13th Annual Symposium on Discrete Algorithms, 2002. 18, 20, 22
16. J. Nievergelt and P. Widmayer. Spatial data structures: Concepts and design choices. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 725–764. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000. 17
17. M. Overmars. Efficient data structures for range searching on a grid. Journal of Algorithms, 9:254–275, 1988. 21, 22
18. P. van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters, 6:80–82, 1977. 23