2724 search results - page 492 / 545 » Optimizing Queries on Files |
181
click to vote
VLDB
2002
ACM
16 years 3 days ago
2002
ACM
Relational database systems have traditionally optimized for I/O performance and organized records sequentially on disk pages using the N-ary Storage Model (NSM) (a.k.a., slotted ...
185
click to vote
VLDB
2007
ACM
16 years 3 days ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
190
click to vote
SIGMOD
2009
ACM
16 years 3 days ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
175
click to vote
SIGMOD
2007
ACM
16 years 17 hour ago
2007
ACM
Two trends are converging to make the CPU cost of a table scan a more important component of database performance. First, table scans are becoming a larger fraction of the query p...
105
click to vote
SIGMOD
2002
ACM
16 years 15 hour ago
2002
ACM
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...