Special Issue: Data Management and Data Mining

• Articles • Previous Articles     Next Articles

Dynamic Interval Index Structure in Constraint Database Systems

WANG Wei; WaNG Yujun; SHI Baile;   

  1. Department of Computer Science; Fudan University; Shanghai 200433; P.R. China ;
  • Online:2000-11-10 Published:2000-11-10

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 is O(n), and the query I/O complexity is O(log n+t/B). To improve the performance of the inserting and deleting operations, some methods such as neighbor…

Key words: high performance general-purpose;

[1] Dina la Goldin, Paris Kanellakis. Constraint query algebra. Constraints Journal, 1996, (1).

[2] Wang Yujun. Constraint database: Scheme design, algebra query language and indexing (dissertation.) Fudan University, 1997.

[3] Hanan Samet. The Design and Analysis of Spatial Data Structure. Addison-Wesley Publishing Company, 1989. ……….
[1] Wei-Wu Hu, Rui Hou, Jun-Hua Xiao, and Long-Bin Zhang. High Performance General-Purpose Microprocessors: Past and Future [J]. , 2006, 21(5): 631-640 .
Full text



No Suggested Reading articles found!

ISSN 1000-9000(Print)

CN 11-2296/TP

Editorial Board
Author Guidelines
Journal of Computer Science and Technology
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
E-mail: jcst@ict.ac.cn
  Copyright ©2015 JCST, All Rights Reserved