Sciweavers

2121 search results - page 130 / 425
» Indexing Incomplete Databases
Sort
View
ICDE
2000
IEEE
158views Database» more  ICDE 2000»
16 years 6 months ago
The DC-Tree: A Fully Dynamic Index Structure for Data Warehouses
: Many companies have recognized the strategic importance of the knowledge hidden in their large databases and have built data warehouses. Typically, updates are collected and appl...
Hans-Peter Kriegel, Jörn Kohlhammer, Martin E...
ACNS
2008
Springer
94views Cryptology» more  ACNS 2008»
15 years 11 months ago
Restricted Queries over an Encrypted Index with Applications to Regulatory Compliance
Compliance storage is an increasingly important area for businesses faced with a myriad of new document retention regulations. Today, businesses have turned to Write-One Read Many ...
Nikita Borisov, Soumyadeb Mitra
VLDB
2000
ACM
166views Database» more  VLDB 2000»
15 years 8 months ago
Oracle8i Index-Organized Table and Its Application to New Domains
Primary B+ -tree, a variant of B+ -tree structure with row data in leaf blocks, is an ideal storage organization for queries involving exact match and/or range search on primary k...
Jagannathan Srinivasan, Souripriya Das, Chuck Frei...
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
15 years 2 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
ICDE
2008
IEEE
161views Database» more  ICDE 2008»
16 years 6 months ago
COLR-Tree: Communication-Efficient Spatio-Temporal Indexing for a Sensor Data Web Portal
Abstract-- We present COLR-Tree, an abstraction layer designed to support efficient spatio-temporal queries on live data gathered from a large collection of sensors. We use COLR-Tr...
Yanif Ahmad, Suman Nath