Skip to main content
SpringerLink
Log in
Book cover

International Conference on Extending Database Technology

EDBT 1998: Advances in Database Technology — EDBT'98 pp 39–53Cite as

Towards optimal indexing for segment databases

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1377))

Abstract

Segment databases store N non-crossing but possibly touching segments in secondary storage. Efficient data structures have been proposed to determine all segments intersecting a vertical line (stabbing queries). In this paper, we consider a more general type of query for segment databases, determining intersections with respect to a generalized segment (a line, a ray, a segment) with a fixed angular coefficient. We propose two solutions to solve this problem. The first solution has optimal O(N/B) space complexity, where N is the database size and B is the page size, but the query time is far from optimal. The second solution requires O(N/B log2 B) space, the query time is O(logB N/B(logB N/B+log2 B+IL * (B))+T/B), which is very close to the optimal, and insertion amortized time is O(logB N/B+log2 B+1/Blog2 B N/B), where T is the size of the query result, and IL * (B) is a small constant, representing the number of times we must repeatedly apply the log* function to B before the result becomes ≤ 2.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Arge. The Buffer Tree: A New Technique for Optimal I/O Algorithms. In LNCS 955: Proc. of the 4th Int. Workshop on Algorithms and Data Structures, pages 334–345, 1995.

    Google Scholar 

  2. L. Arge, D.E. Vengroff, and J. S. Vitter. External-Memory Algorithms for Processing Line Segments in Geographic Information Systems. In Proc. of the 3rd Annual European Symp. on Algorithms, pages 295–310, 1995.

    Google Scholar 

  3. L. Arge and J. S. Vitter. Optimal Dynamic Interval Management in External Memory. In Proc. of the Int. Symp. on Foundations of Computer Science, pages 560–569, 1996.

    Google Scholar 

  4. E. Bertino, B. Catania, and B. Shidlovsky. Towards Optimal Indexing for Segment Databases. Extended version. Technical report, University of Milano, Italy, 1998.

    Google Scholar 

  5. B. Chazelle and L.J. Guibas. Fractional Cascading: I. A Data Structuring Technique. Algorithmica, 1(2):133–162, 1986.

    Article  MathSciNet  Google Scholar 

  6. S.W. Cheng and R. Janardan. Efficient Dynamic Algorithms for Some Geometric Intersection Problems. Information Processing Letters, 36(5):251–258, 1990.

    Article  MathSciNet  Google Scholar 

  7. Y.-J. Chiang and R. Tamassia. Dynamic Algorithms in Computational Geometry. Proc. IEEE, 80(9):1412–1434, 1992.

    Article  Google Scholar 

  8. D. Comer. The ubiquitous B-tree. Computing Surveys, 11(2):121–138, 1979.

    Article  Google Scholar 

  9. H. Edelsbrunner. A New Approach to Rectangular Intersection. Part I. Int. J. Comp. Mathematics, 13:209–219, 1983.

    MathSciNet  Google Scholar 

  10. A. Guttman. R-trees: A Dynamic Index Structure for Spatial Searching. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 47–57, 1984.

    Google Scholar 

  11. C. Icking, R. Klein, and T. Ottmann. Priority Search Trees in Secondary Memory. In LNCS 314: Proc. of the Int. Workshop on Graph-Theoretic Concepts in Computer Science, pages 84–93, 1988.

    Google Scholar 

  12. K. Mehlhorn and S. Naher. Dynamic Fractional Cascading. Algorithmica, 5(2):215–241, 1990.

    Article  MathSciNet  Google Scholar 

  13. P. Kanellakis, G. Kuper, and P. Revesz. Constraint Query Languages. J. Comp. System Sciences, 51(1):25–52, 1995.

    MathSciNet  Google Scholar 

  14. P.C. Kanellakis, S. Ramaswamy, D.E. Vengroff, and J.S. Vitter. Indexing for Data Models with Constraints and Classes. J. Comp. System Sciences, 52(3):589–612, 1996.

    Article  MathSciNet  Google Scholar 

  15. M. Koubarakis. Database Models for Infinite and Indefinite Temporal Information. Information Systems, 19(2):141–173, 1994.

    Article  Google Scholar 

  16. E.McCreight. Priority Search Trees. SIAM Journal of Computing. 14(2): 257–276, 1985.

    Article  MathSciNet  Google Scholar 

  17. J. Nievergelt and E. M. Reingold. Binary Search Tree of Bounded Balance. SIAM J. Computing, 2(1):33–43, 1973.

    Article  MathSciNet  Google Scholar 

  18. J. Paredaens. Spatial Databases, the Final Frontier. In LNCS 893: Proc. of the 5th Int. Conf. on Database Theory, pages 14–31, 1995.

    Google Scholar 

  19. S. Ramaswamy and S. Subramanian. Path-Caching: A Technique for Optimal External Searching. In Proc. of the ACM Symp. on Principles of Database Systems, pages 25–35, 1994.

    Google Scholar 

  20. S. Ramaswamy. Efficient Indexing for Constraints and Temporal Databases. In LNCS 1186: Proc. of the 6th Int. Conf. on Database Theory, pages 419–431, 1997.

    Google Scholar 

  21. S. Subramanian and S. Ramaswamy. The P-Range Tree: A New Data Structure for Range Searching in Secondary Memory. In Proc. of the ACM-SIAM Symp. on Discrete Algorithms, pages 378–387, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, Via Comelico 39/41, 20135, Milano, Italy

    E. Bertino & B. Catania

  2. Grenoble Laboratory 6, Rank Xerox Research Center, chemin de Maupertuis, 38240, Meylan, France

    B. Shidlovsky

Authors
  1. E. Bertino
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. Catania
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. B. Shidlovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hans-Jörg Schek Gustavo Alonso Felix Saltor Isidro Ramos

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bertino, E., Catania, B., Shidlovsky, B. (1998). Towards optimal indexing for segment databases. In: Schek, HJ., Alonso, G., Saltor, F., Ramos, I. (eds) Advances in Database Technology — EDBT'98. EDBT 1998. Lecture Notes in Computer Science, vol 1377. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0100976

Download citation

  • DOI: https://doi.org/10.1007/BFb0100976

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64264-0

  • Online ISBN: 978-3-540-69709-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation