Sciweavers

9414 search results - page 207 / 1883
» Adaptive Query Processing
Sort
View
AAAI
2008
15 years 5 months ago
Adapting ADtrees for High Arity Features
ADtrees, a data structure useful for caching sufficient statistics, have been successfully adapted to grow lazily when memory is limited and to update sequentially with an increme...
Robert Van Dam, Irene Langkilde-Geary, Dan Ventura
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
16 years 3 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
DKE
1998
88views more  DKE 1998»
15 years 2 months ago
Temporal Grid File: A File Structure for Interval Data
Disk I/O is a major bottleneck for query processing in database applications. This bottleneck is especially a problem for temporal databases because of their large size. Reduction...
Chiang Lee, Te-Ming Tseng
VLDB
2004
ACM
112views Database» more  VLDB 2004»
15 years 8 months ago
AIDA: an Adaptive Immersive Data Analyzer
In this demonstration, we show various querying capabilities of an application called AIDA. AIDA is developed to help the study of attention disorder in kids. In a different stud...
Mehdi Sharifzadeh, Cyrus Shahabi, Bahareh Navai, F...
APPROX
2009
Springer
85views Algorithms» more  APPROX 2009»
15 years 9 months ago
Algorithmic Aspects of Property Testing in the Dense Graphs Model
In this paper we consider two basic questions regarding the query complexity of testing graph properties in the adjacency matrix model. The first question refers to the relation ...
Oded Goldreich, Dana Ron