Sciweavers

2539 search results - page 195 / 508
» Updates for Structure Indexes
Sort
View
ESA
2006
Springer
125views Algorithms» more  ESA 2006»
15 years 7 months ago
Purely Functional Worst Case Constant Time Catenable Sorted Lists
We present a purely functional implementation of search trees that requires O(log n) time for search and update operations and supports the join of two trees in worst case constant...
Gerth Stølting Brodal, Christos Makris, Kos...
KDD
2004
ACM
114views Data Mining» more  KDD 2004»
16 years 5 months ago
Scalable mining of large disk-based graph databases
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
Chen Wang, Wei Wang 0009, Jian Pei, Yongtai Zhu, B...
ICDE
2005
IEEE
139views Database» more  ICDE 2005»
16 years 6 months ago
Compressing Bitmap Indices by Data Reorganization
Many scientific applications generate massive volumes of data through observations or computer simulations, bringing up the need for effective indexing methods for efficient stora...
Ali Pinar, Tao Tao, Hakan Ferhatosmanoglu
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
16 years 2 months ago
On the Cell Probe Complexity of Dynamic Membership
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
KE YI, QIN ZHANG
VLDB
1994
ACM
152views Database» more  VLDB 1994»
15 years 9 months ago
The GMAP: A Versatile Tool for Physical Data Independence
Physical data independence is touted as a central feature of modern database systems. Both relational and object-oriented systems, however, force users to frame their queries in t...
Odysseas G. Tsatalos, Marvin H. Solomon, Yannis E....