313 search results - page 60 / 63 » Data Sufficiency for Queries on Cache |
USENIX
2008
13 years 10 months ago
2008
In many of today's applications, access to storage constitutes the major cost of processing a user request. Data prefetching has been used to alleviate the storage access lat...
SIGMOD
2010
ACM
13 years 2 months ago
2010
ACM
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vect...
VLDB
1998
ACM
14 years 12 days ago
1998
ACM
Text data in the Internet can be partitioned into many databases naturally. Efficient retrieval of desired data can be achieved if we can accurately predict the usefulness of each...
TKDE
2010
13 years 6 months ago
2010
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...
IADIS
2004
13 years 9 months ago
2004
The GoogleTM API enables software agents to query and use search results from the large collections of data available via the ever-popular Google search engine. Web searches using...