Towards optimal indexing for segment databases

  • E. Bertino
  • B. Catania
  • B. Shidlovsky
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1377)


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.


Internal Node Short Fragment Query Time Internal Memory Segment Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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. 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. 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. 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. 5.
    B. Chazelle and L.J. Guibas. Fractional Cascading: I. A Data Structuring Technique. Algorithmica, 1(2):133–162, 1986.CrossRefMathSciNetGoogle Scholar
  6. 6.
    S.W. Cheng and R. Janardan. Efficient Dynamic Algorithms for Some Geometric Intersection Problems. Information Processing Letters, 36(5):251–258, 1990.CrossRefMathSciNetGoogle Scholar
  7. 7.
    Y.-J. Chiang and R. Tamassia. Dynamic Algorithms in Computational Geometry. Proc. IEEE, 80(9):1412–1434, 1992.CrossRefGoogle Scholar
  8. 8.
    D. Comer. The ubiquitous B-tree. Computing Surveys, 11(2):121–138, 1979.CrossRefGoogle Scholar
  9. 9.
    H. Edelsbrunner. A New Approach to Rectangular Intersection. Part I. Int. J. Comp. Mathematics, 13:209–219, 1983.MathSciNetGoogle Scholar
  10. 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. 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. 12.
    K. Mehlhorn and S. Naher. Dynamic Fractional Cascading. Algorithmica, 5(2):215–241, 1990.CrossRefMathSciNetGoogle Scholar
  13. 13.
    P. Kanellakis, G. Kuper, and P. Revesz. Constraint Query Languages. J. Comp. System Sciences, 51(1):25–52, 1995.MathSciNetGoogle Scholar
  14. 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.CrossRefMathSciNetGoogle Scholar
  15. 15.
    M. Koubarakis. Database Models for Infinite and Indefinite Temporal Information. Information Systems, 19(2):141–173, 1994.CrossRefGoogle Scholar
  16. 16.
    E.McCreight. Priority Search Trees. SIAM Journal of Computing. 14(2): 257–276, 1985.CrossRefMathSciNetGoogle Scholar
  17. 17.
    J. Nievergelt and E. M. Reingold. Binary Search Tree of Bounded Balance. SIAM J. Computing, 2(1):33–43, 1973.CrossRefMathSciNetGoogle Scholar
  18. 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. 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. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • E. Bertino
    • 1
  • B. Catania
    • 1
  • B. Shidlovsky
    • 2
  1. 1.Dipartimento di Scienze dell'InformazioneUniversità degli Studi di MilanoMilanoItaly
  2. 2.Grenoble Laboratory 6Rank Xerox Research CenterMeylanFrance

Personalised recommendations