1709 search results - page 176 / 342 » Comparing the Performance of Database Selection Algorithms |
177
click to vote
DRM
2003
Springer
15 years 11 months ago
2003
Springer
Agrawal and Kiernan’s watermarking technique for database relations [1] and Li et al’s fingerprinting extension [6] both depend critically on primary key attributes. Hence, t...
179
click to vote
CIKM
2009
Springer
16 years 28 days ago
2009
Springer
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
259
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
A conventional materialized view blindly materializes and maintains all rows of a view, even rows that are never accessed. We propose a more flexible materialization strategy aime...
156
click to vote
MMM
2005
Springer
15 years 12 months ago
2005
Springer
In recent years, relevance feedback has been studied extensively as a way to improve performance of content-based image retrieval (CBIR). However, since users are usually unwillin...
154
Voted
SIGMOD
1994
ACM
15 years 10 months ago
1994
ACM
We describe an algorithm for estimating the number of page fetches for a partial or complete scan of a B-tree index. The algorithm obtains estimates for the number of page fetches ...