Indexing for data models with constraints and classes

Journal of Computer and System Sciences

Volumn 52, Issue 3, 1996, Pages 589-612

  Kanellakis, Paris ^a   Ramaswamy, Sridhar ^a,c   Vengroff, Darren E ^b   Vitter, Jeffrey Scott ^b  

^a Brown University   (United States)

^b Duke University   (United States)

^c TELCORDIA TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL SYSTEMS; INPUT OUTPUT PROGRAMS; MATHEMATICAL PROGRAMMING; OBJECT ORIENTED PROGRAMMING; OPTIMIZATION; QUERY LANGUAGES; RELATIONAL DATABASE SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS);

CLASS HIERARCHY; CONSTRAINT PROGRAMMING; TWO DIMENSIONAL RANGE SEARCHING; WORST CASE SPACE;

DATA STRUCTURES;

EID: 0030171860     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0043     Document Type: Article

References (40)

1. R. Bayer and E. McCreight, Organization of large ordered indexes, Acta Inform. 1 (1972), 173-189.
2. N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger, The R*-tree: An efficient and robust access method for points and rectangles, in "Proceedings, 1990 ACM SIGMOD Conference on Management of Data, 1990," pp. 322-331.
3. J. L. Bentley, "Algorithms for Klee's Rectangle Problems," Dept. of Computer Science, Carnegie Mellon University, unpublished notes, 1977.
4. J. L. Bentley, Multidimensional divide and conquer, Comm. ACM 23, No. 6 (1980), 214-229.
5. G. Blankenagel and R. H. Güting, "XP-Trees - External Priority Search Trees," Fern Universität Hagen, Informatik-Bericht Nr. 92, 1990.
6. G. Blankenagel and R. H. Güting, "External Segment Trees," Fern Universität Hagen, Informatik-Bericht, 1990.
7. B. Chazelle, Lower bounds for orthogonal range searching. I. The reporting case, J. Assoc. Comput. Mach. 37, No. 2 (1990), 200-212.
8. Y.-J. Chiang and R. Tamassia, Dynamic algorithms in computational geometry, Proc. IEEE (special issue on computational geometry) 80, No. 9 (1992), 362-381.
9. E. F. Codd, A relational model for large shared data banks, Comm. ACM 13, No. 6 (1970), 377-387.
10. D. Comer, The ubiquitous B-tree, Comput. Surveys 11, No. 2 (1979), 121-137.
11. H. Edelsbrunner, A new approach to rectangle intersections, Part II, Int. J. Comput. Math. 13 (1983), 221-229.
12. H. Edelsbrunner, A new approach to rectangle intersections, Part I, Int. J. Comput. Math. 13 (1983), 209-219.
13. M. L. Fredman, A lower bound on the complexity of orthogonal range queries, J. Assoc. Comput. Math. 28 (1981), 696-705.
14. M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter, External-memory computational geometry, in "Proceedings, 34th Annual IEEE Symposium on Foundations of Computer Science, 1993," pp. 714-723.
15. O. Günther, The design of the cell tree: An object-oriented index structure for geometric databases, in "Proceedings, Fifth Int. Conf. on Data Engineering, 1989," pp. 598-605.
16. A. Guttman, R-trees: A dynamic index structure for spatial searching, in "Proceedings, 1984 ACM SIGMOD Conference on Management of Data, 1985," pp. 47-57.
17. C. Icking, R. Klein, and T. Ottmann, "Priority Search Trees in Secondary Memory (Extended Abstract)," Lecture Notes in Computer Science, Vol. 314, Springer-Verlag, New York/Berlin, 1988.
18. J. Jaffar and J. L. Lassez, Constraint logic programming, in "Proceedings, 14th ACM POPL, 1987," pp. 111-119.
19. P. C. Kanellakis, G. M. Kuper, and P. Z. Revesz, Constraint query languages, in "Proceedings, 9th ACM PODS, 1990," pp. 299-313; J. Comput. System Sci. 51 (1995), 26-52; Technical Report 90-31, Brown University, 1990.
20. P. C. Kanellakis, G. M. Kuper, and P. Z. Revesz, Constraint query languages, in "Proceedings, 9th ACM PODS, 1990," pp. 299-313; J. Comput. System Sci. 51 (1995), 26-52; Technical Report 90-31, Brown University, 1990.
21. P. C. Kanellakis, G. M. Kuper, and P. Z. Revesz, Constraint query languages, in "Proceedings, 9th ACM PODS, 1990," pp. 299-313; J. Comput. System Sci. 51 (1995), 26-52; Technical Report 90-31, Brown University, 1990.
22. W. Kim, K. C. Kim, and A. Dale, Indexing techniques for object-oriented databases, in "Object-Oriented Concepts, Databases, and Applications" (W. Kim and F. H. Lochovsky, Eds.), Addison-Wesley, Reading, MA, pp. 371-394, 1989.
23. W. Kim and F. H. Lochovsky (Eds.), "Object-Oriented Concepts, Databases, and Applications," Addison-Wesley, Reading, MA, 1989.
24. D. B. Lomet and B. Salzberg, The hB-tree: A multiattribute indexing method with good guaranteed performance, ACM Trans. Database Systems 15, No. 4 (1990), 625-658.
25. C. C. Low, B. C. Ooi, and H. Lu, H-trees: A dynamic associative search index for OODB, in "Proceedings, ACM SIGMOD, 1992," pp. 134-143.
26. D. Maier and J. Stein, Indexing in an object-oriented DBMS, in "IEEE Proceedings, International Workshop on Object-Oriented Database Systems, 1986," pp. 171-182.
27. E. M. McCreight, Priority search trees, SIAM J. Comput. 14, No. 2 (1985), 257-276.
28. J. Nievergelt, H. Hinterberger, and K. C. Sevcik, The grid file: An adaptable, symmetric multikey file structure, ACM Trans. Database Systems 9, No. 1 (1984), 38-71.
29. J. A. Orenstein, Spatial query processing in an object-oriented database system, in "Proceedings, ACM SIGMOD, 1986," pp. 326-336.
30. M. H. Overmars, M. H. M. Smid, M. T. de Berg, and M. J. van Kreveld, Maintaining range trees in secondary memory. Part I. Partitions, Acta Inform. 27 (1990), 423-452.
31. S. Ramaswamy and S. Subramanian, Path catching: A technique for optimal external searching, in "Proceedings, 13th ACM PODS, 1994," pp. 25-35.
32. J. T. Robinson, The K-D-B tree: A search structure for large multi-dimensional dynamic indexes, in "Proceedings, ACM SIGMOD, 1984."
33. H. Samet, "Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS," Addison-Wesley, Reading, MA, 1989.
34. H. Samet, "The Design and Analysis of Spatial Data Structures," Addison-Wesley, Reading, MA, 1989.
35. +-tree: A dynamic index for multi-dimensional objects, in "Proceedings, 1987 VLDB Conference, Brighton, England, 1987."
36. D. D. Sleator and R. E. Tarjan, A data structure for dynamic trees, J. Comput. System Sci. 24 (1983), 362-381.
37. M. H. M. Smid and M. H. Overmars, Maintaining range trees in secondary memory. Part II. Lower bounds, Acta Inform. 27 (1990), 453-480.
38. S. Subramanian and S. Ramaswamy, The P-range tree: A new data structure for range searching in secondary memory, in "Proceedings, Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995."
39. J. S. Vitter, Efficient memory access in large-scale computation, in "1991 Symposium on Theoretical Aspects of Computer Science (STACS)," Lecture Notes in Computer Science, Springer-Verlag, New York/Berlin, 1991.
40. S. Zdonik and D. Maier, "Readings in Object-Oriented Database Systems," Morgan Kaufmann, San Mateo, CA, 1990.