Sciweavers

1890 search results - page 217 / 378
» Querying Big Data by Accessing Small Data
Sort
View
ICDE
2003
IEEE
138views Database» more  ICDE 2003»
16 years 21 days ago
Using State Modules for Adaptive Query Processing
We present a query architecture in which join operators are decomposed into their constituent data structures (State Modules, or SteMs), and dataflow among these SteMs is managed ...
Vijayshankar Raman, Amol Deshpande, Joseph M. Hell...
VLDB
2007
ACM
155views Database» more  VLDB 2007»
15 years 5 months ago
Best Position Algorithms for Top-k Queries
The general problem of answering top-k queries can be modeled using lists of data items sorted by their local scores. The most efficient algorithm proposed so far for answering to...
Reza Akbarinia, Esther Pacitti, Patrick Valduriez
FAST
2010
15 years 1 months ago
Bimodal Content Defined Chunking for Backup Streams
Data deduplication has become a popular technology for reducing the amount of storage space necessary for backup and archival data. Content defined chunking (CDC) techniques are w...
Erik Kruus, Cristian Ungureanu, Cezary Dubnicki
WWW
2007
ACM
16 years 22 hour ago
Detecting near-duplicates for web crawling
Near-duplicate web documents are abundant. Two such documents differ from each other in a very small portion that displays advertisements, for example. Such differences are irrele...
Gurmeet Singh Manku, Arvind Jain, Anish Das Sarma
ASIACRYPT
2008
Springer
15 years 1 months ago
Compact Proofs of Retrievability
In a proof-of-retrievability system, a data storage center must prove to a verifier that he is actually storing all of a client's data. The central challenge is to build syst...
Hovav Shacham, Brent Waters