Managing intervals efficiently in object-relational databases

Proceedings of the 26th International Conference on Very Large Data Bases, VLDB'00

Volumn , Issue , 2000, Pages 407-418

  Kriegel, Hans Peter ^a   Pötke, Marco ^a   Seidi, Thomas ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT HANDLING; DATABASE APPLICATIONS; DYNAMIC MANAGEMENT; EXPERIMENTAL EVALUATION; OBJECT-RELATIONAL DATABASE; QUERY RESPONSE TIME; TEMPORAL AND SPATIAL; VIRTUAL BACKBONE TREES;

FORESTRY; QUERY PROCESSING; RELATIONAL DATABASE SYSTEMS;

TREES (MATHEMATICS);

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

References (35)

1. [AT 95] AngC.-H.,Tan K-P.: The IntervatB-Tree.Infop.,ation Processing Letters 53(2): 85-89, 1995.
2. [AV 961 Arge L., Vitter J.S.: Optimal Dynamic Interval Management in External Memory.Proc.37th Annual Symp.on Foundations of Computer Science, 560-569, 1996.
3. [BKK99] Böhm C., Klump G., Kriegel 11.-P.: XZOrdering: A Space-Filling Curve for Objects with Spatial Extension.Proc.6th Int.Symp.on Large Spatial Databases, LNCS 1651,75-90, 1999.
4. [BKSS 901 Beckmann N., Kriegel H.-P., Schneider R., Seeger B.: The R-tree: An Efficient and Robust Access Method for Points and Rectangles.Proc.ACM SIGMOD mt.Conf.on Management of Data, 322-331, 199O
5. [BO 98] Bozkaya T., Ozsoyoglu Z.M.: Indexing Valid flme Intervals.Proc.9th Int.Conf.on Database and Expert Systems Applications, LNCS 1460, 541550, 1998.
6. [BSSJ 99] Bliujute R., Saltenjs S., Slivinskas O, Jensen C.S.: Developing a DataBlade for a New Index.Proc.IEEE mt.Conf.on Data Engineering, 3 14-323, 1999.
7. [CLR 90] Cormen T.H., Leiserson C.E., Rivest R.L.: Introduction to Algorithms.Cambridge, MA: MIT-Press, 199O
8. [Ede 80] Edelsbrunner H.: Dynamic Rectangle Intersection Searching.Institute for Information Processing Report 47, Technical University of Gras, Austria, 198O
9. [EWK 90] Elmasri R., Wuu O T.J., Kim Y.-J.: The 7me Index: An Access Structure for Temporal Data.Proc.16th Int.Conf.on Very Large Databases, 1-12, 199O
10. [FMB 00] Fenk R., Markl V., Bayer R.: Manageman, and Query Processing of One-Dimensional Intervals with the UBTree.PhD Workshop, 7th Conf.on Extending Database Technology, Konstanz, Germany, 7-10, 2000,
11. [FR 891 Faloutsos C.Roseman S.: Fractals for Secondary Key Retrieval.Proc.8th ACM Symp.on Principles of Database Systems, 247-252, 1989.
12. [GLOT 961 Goh C.H., Lu H., Ooi B.C., Tan K.-L.: Indexing Temporal Data Using Existing B+-Trees.Data Knowledge Engineering, Elsevier, 18(2): 147-165, 1996.
13. [Gut 84] Guttman A.: R-trees: A Dynamic Index Structure for Spatial Searching.Proc.ACM SIGMOD Int.Conf.on Management of Data, 47-57, 1984.
14. [HJ 96] Hanson E., Johnson T.: Selection Predicate indexing for Active Databases Using Interval Skip Lists.Information Systems, 2 1(3): 269-298, 1996.
15. [HNP 95] Hellerstein J.M., Naughton 3.F., Pfeffer A.: Generalized Search Treesfor Database Systems.Proc.21st mt.Conf.on Very Large Datahasec.562-573, 1995.
16. [HP 941 Hellerstein J.M., Pfeffer A.: The RD-Tree: An Index Structure for Sets.Technical Report #1252, University of Wisconsin at Madison, Oct.1994.
17. [IBM 99] IBM Corp.: IBM DB2 Universal Database Application Development Guide, Version 6.Armonk, NY, 1999.
18. [Inf 98] Informix Software, Inc.: DataBlade Developers Kit User's Guide.Menlo Park, CA, 1998.
19. [KRVV 93] Kanellakis P.C., Ramaswamy S., VengroffD.E., 'Jitter 3.S.: Indexing for Data Models with Constraints and Classes.Proc.12th ACM Symp.on Principles of Database Systems, 23 3-243, 1993.
20. [KPS 00] Krieget H.-P., Pdtke M., Seidl T.: Relational interval Tree.EPO patent application, 200O
21. [KS 91] Kolovson C.P., Stonebraker M.: Segment Indexes: Dynamic indexing Techniques for Multi-Dimensional Interval Data.Proc.ACM SIGMOD Int.Conf.on ManagementofData, 138-147, 1991.
22. [LT 98] Lee C., Tseng T.-M.: Temporal Grid File: A File Structureforinterval Data.DataKnowledge Engineering, Elsevier, 26(1): 7 1-97, 1998.
23. [MTI'OO] Manolopoulos Y., Theodoridis Y., Tsotras V.J.: Advanced Database Indexing.Chapter 4: Access Methods for Intervals.Boston, MA: Kluwer, 200O
24. [ND 99] Nascimento M.A., Dunham M.H.: Indexing Valid flme Databases via 8+-Trees.IEEE Trans.on Knowledge and Data Engineering 11(6): 929-947, 1999.
25. [Ora 97] Oracle Corp.: Oracle8 Spatial Cartridge User's Guide and Refe rence, Re!.8.O4.Redwood City, CA, 1997.
26. [Ora 99aj Oracle Corp.: Oracle8i Data Cartridge Developer's Guide, Re!.8.1.5.Redwood City, CA, 1999.
27. [Ora 99b] Oracle Corp.: Oracle8i Spatial User's Guide and Reference, Re!.8.1.5.Redwood City, CA, 1999.
28. [PS 93] Preparata F.P., Shamos M.I.: Computational Geometry: An introduction.5th ed., Springer, 1993.
29. [Ram 97] Ramaswamy S.: Efficient Indexing for Constraint and Temporal Databases.Proc.6th Int.Conf.on Database Theory, LNCS 1186, 419-431, 1997.
30. [RS 99] Ravada S., Shanna J.: Oracle8i Spatial: Experiences with Extensible Databases.Proc.6th Int.Symp.on Large Spatial Databases, LNCS 1651,355-359, 1999.
31. [Sam 90a] Samet H.: The Design and Analysis of Spatial Data Structures.Reading, MA: Addison-Wesley, 199O
32. [Sam 90b] Samet H.: Applications of Spatial Data Structures.Reading, MA: Addison-Wesley, 199O
33. [SOL 94] Shen H., Ooi B.C., Lu H.: The TP-Index: A Dynamic and Efficient Indexing Mechanism for Temporal Databases.Proc.IEEE Int.Conf.on Data Engineering.274-281, 1994,
34. [SRF 87] Sellis T., Roussopoulos N., Faloutsos C.: The R-Tree: A Dynamic IndexforMulti-Dimensional Objects.Proc.Int.Conf.on Very Large Databases, 507-5 18, 1987.
35. [TCG+ 93] Tansel A.U., Clifford J., Gadia S., Jajodia S., Segev A., Snodgrass R.: Temporal Databases: Theory, Design and imp! ementati on.Redwood City, CA, 1993.