A cost model for interval intersection queries on RI-trees

Proceedings of the International Conference on Scientific and Statistical Database Management, SSDBM

Volumn 2002-January, Issue , 2002, Pages 131-141

  Kriegel, H P ^a   Pfeifle, M ^a   Potke M ^b   Seidl, T ^a  

^a UNIVERSITY OF MUNICH   (Germany)

^b SD and M AG Software Design and Management   (Germany)

Author keywords

Conference management; Costs; Databases

Indexed keywords

COST BENEFIT ANALYSIS; COST ESTIMATING; COSTS; DATABASE SYSTEMS; ERROR STATISTICS; FORESTRY; MANAGEMENT INFORMATION SYSTEMS; QUERY LANGUAGES; QUERY PROCESSING; TREES (MATHEMATICS);

AVERAGE RELATIVE ERROR; CONFERENCE MANAGEMENT; DATA-BASE SERVERS; EFFICIENT MANAGEMENTS; EXECUTION PLANS; EXPERIMENTAL EVALUATION; ORACLE DATABASE; TEMPORAL AND SPATIAL;

RELATIONAL DATABASE SYSTEMS;

EID: 5544234916     PISSN: 10993371     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SSDM.2002.1029713     Document Type: Conference Paper

References (33)

1. Acharya S., Poosala V., Ramaswamy S.: Selectivity Estimation in Spatial Databases. Proc. ACM SIGMOD, 13-24, 1999.
2. Belussi A., Faloutsos C.: Estimating the Selectivity of Spatial Queries Using the 'Correlation' Fractal Dimension. Proc. VLDB, 299-310, 1995.
3. Böhm C., Klump G., Kriegel H.-P.: XZ-Ordering: A Space-Filling Curve for Objects with Spatial Extension. Proc. SSD (LNCS 1651), 75-90, 1999.
4. Bozkaya T., Özsoyoglu Z. M.: Indexing Valid Time Intervals. Proc. DEXA, LNCS 1460, 541-550, 1998.
5. Boulos J., Ono K.: Cost Estimation of User-Defined Methods in Object-Relational Database Systems. ACM SIGMOD Record, 28(3), 22-28, 1999.
6. Bliujute R., Saltenis S., Slivinskas G., Jensen C.S.: Developing a DataBlade for a New Index. Proc. ICDE, 314-323, 1999.
7. Chen W., Chow J.-H., Fuh Y.-C., Grandbois J., Jou M., Mattos N., Tran B., Wang Y.: High Level Indexing of User-Defined Types. Proc. VLDB, 554-564, 1999.
8. Edelsbrunner H.: Dynamic Rectangle Intersection Searching. Inst. for Information Processing Report 47, Technical University of Graz, Austria, 1980.
9. Faloutsos C., Roseman S.: Fractals for Secondary Key Retrieval. Proc. ACM PODS, 247-252, 1989.
10. Gaede V., Günther O.: Multidimensional Access Methods. ACM Computing Surveys 30(2), 170-231, 1998.
11. Huang Y.-W., Jing N., Rundensteiner E. A.: A Cost Model for Estimating the Performance of Spatial Joins Using R-trees. Proc. SSDBM, 30-38, 1997.
12. Haas P. J., Naughton J. F., Seshadri S., Stokes L.: Sampling-Based Estimation of the Number of Distinct Values of an Attribute. Proc. VLDB, 311-322, 1995.
13. Hellerstein J., Stonebraker M.: Predicate Migration: Optimizing Queries with Expensive Predicates. Proc. ACM SIGMOD, 267-276, 1993.
14. IBM Corp.: IBM DB2 Universal Database Application Development Guide, Version 6. Armonk, NY, 1999.
15. Informix Software, Inc.: DataBlade Developers Kit User's Guide, Version 3.4. Menlo Park, CA, 1998.
16. Kamel I., Faloutsos C.: On Packing R-trees. Proc. ACM CIKM, 490-499, 1993.
17. Kriegel H.-P., Pötke M., Seidl T.: Managing Intervals Efficiently in Object-Relational Databases. Proc. VLDB, 407-418, 2000.
18. Kriegel H.-P., Pötke M., Seidl T.: Object-Relational Indexing for General Interval Relationships. Proc. SSTD (LNCS 2121), 522-542, 2001.
19. Kriegel H.-P., Pötke M., Seidl T.: Interval Sequences: An Object-Relational Approach to Manage Spatial and Temporal Data. Proc. SSTD (LNCS 2121), 481-501, 2001.
20. Leutenegger S. T., Lopez M. A.: The Effect of Buffering on the Performance of R-Trees. Proc. ICDE, 164-171, 1998.
21. Lipton R. J., Naughton J. F., Schneider A. D.: Practical Selectivity Estimation through Adaptive Sampling. Proc. ACM SIGMOD, 1-11, 1990.
22. Lomet D.: B-tree Page Size When Caching is Considered. ACM SIGMOD Record 27(3), 28-32, 1998.
23. Oracle Corp.: Oracle8i Data Cartridge Developer's Guide, Release 2 (8.1.6). Redwood Shores, CA, 1999.
24. Proietti G., Faloutsos C.: Selectivity Estimation of Window Queries for Line Segment Datasets. Proc. ACM CIKM, 340-347, 1998.
25. Proietti G., Faloutsos C.: I/O Complexity for Range Queries on Region Data Stored Using an R-tree. Proc. ICDE, 628-635, 1999.
26. Ramaswamy S.: Efficient Indexing for Constraint and Temporal Databases. Proc. ICDT (LNCS 1186), 419-431, 1997.
27. Selinger P. G., Astrahan M. M., Chamberlin D. D., Lorie R. A., Price T. G.: Access Path Selection in a Relational Database Management System. Proc. ACM SIGMOD, 23-34, 1979.
28. Slivinskas G., Jensen C. S., Snodgrass R. T.: Adaptable Query Optimization and Evaluation in Temporal Middleware. Proc. ACM SIGMOD, 127-138, 2001.
29. Srinivasan J., Murthy R., Sundara S., Agarwal N., DeFazio S.: Extensible Indexing: A Framework for Integrating Domain-Specific Indexing Schemes into Oracle8i. Proc. ICDE, 91-100, 2000.
30. Snodgrass R. T.: Developing Time-Oriented Database Applications in SQL. Morgan Kaufmann, 2000.
31. Shen H., Ooi B. C., Lu H.: The TP-Index: A Dynamic and Efficient Indexing Mechanism for Temporal Databases. Proc. ICDE, 274-281, 1994.
32. Stonebraker M.: Inclusion of New Types in Relational Data Base Systems. Proc. ICDE, 262-269, 1986.
33. Theodoridis Y., Stefanakis E., Sellis T.: Efficient Cost Models for Spatial Queries Using R-Trees. IEEE Trans. on Knowledge and Data Engineering (TKDE), 12(1), 19-32, 2000.