1092 search results - page 74 / 219 » Generating Databases for Query Workloads |
DAWAK
2001
Springer
15 years 3 months ago
2001
Springer
Tree based indexing structures like -trees, ·-trees, Bitmap indexes and Ê-trees have become essential for getting good performance when accessing vast datasets. However, most dat...
165
click to vote
SIGMOD
2007
ACM
15 years 11 months ago
2007
ACM
The Boolean semantics of SQL queries cannot adequately capture the "fuzzy" preferences and "soft" criteria required in non-traditional data retrieval applicati...
102
click to vote
DASFAA
2007
IEEE
15 years 3 months ago
2007
IEEE
Cache groups are a powerful concept for database caching, which is used to relieve the backend database load and to keep referenced data close to the application programs at the &q...
140
click to vote
SIGMOD
2012
ACM
13 years 1 months ago
2012
ACM
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
160
click to vote
SIGMOD
2005
ACM
15 years 11 months ago
2005
ACM
Relational DBMS typically execute concurrent queries independently by invoking a set of operator instances for each query. To exploit common data retrievals and computation in con...