Abstract
Interval index structure plays an important role in constraint database systems. A dynamic interval index structure DM-tree is presented in this paper. The advantage of the DM-tree compared with other interval index structures is that the dynamic operations of insertion and deletion can be operated on the new structure. The storage complexity of the tree isO(n), and the query I/O complexity isO(logn+t/B). To improve the performance of the inserting and deleting operations, some methods such as neighbored-constraint and update-late are applied. The I/O complexity of inserting and deleting operations is the same as that in B-tree, i.e.,O(logn).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Dina Q Goldin, Paris Kanellakis. Constraint query algebraConstraints Journal, 1996, (1).
Wang Yujun. Constraint database: Scheme, design, algebra query language and indexing [dissertation]. Fudan University, 1997.
Hanan Samet. The Design and Analysis of Spatial Data Structure. Addison-Wesley Publishing Company, 1989.
Hanan Samet. Application of Spatial Data Structure. Addison-Wesley Publishing Company, 1989.
Edward M McCreight. Priority search trees.SIAM J. Comput. May 1985 14(2): 257–276.
Herbert Edelsbruner. A new approach to rectangle intersections (Part 1).Int. J Comput., March 1983.
Blankenagel G, Guting R H. External segment tree.Algorithmica, 1994, 12: 498–532.
Paris Kanellakiset al. Indexing for data models with contraints and classes. In:Principle of DataBase’93, Washington, DC, 1993, pp. 25–28.
Sridhar Ramaswamy, Sairam Subramanian. Path caching: A technique for optimal external searching. In:Principle of DataBase’94, Minneapolis, 1994, pp. 24–26.
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the National Natural Science Foundation of China under grant Nos. 69933010 and 69773012.
WANG Wei was born in 1970. He received the M.S. degree in 1992 and the Ph.D. degree in 1998. Now he is a lecturer of the Department of Computer Science, Fudan University. His main research areas include spatial-temporal database, constraint database, index technology and semistructure database.
WANG Yujun was born in 1970. He received the M.S. degree in 1991 and the Ph.D. degree in 1997. Now he is an associate professor of the Department of Computer, Science, Fudan University. His main research areas include object-oriented database, constraint database and index technology.
SHI Baile was born in 1935. He received the M.S. degree in 1956. Now he is a professor of the Department of Computer Science, Fudan University. His main research areas include object-oriented database, knowledge database, digital library.
Rights and permissions
About this article
Cite this article
Wang, W., Wang, Y. & Shi, B. Dynamic interval index structure in constraint database systems. J. Comput. Sci. & Technol. 15, 542–551 (2000). https://doi.org/10.1007/BF02948836
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02948836