Sciweavers

1461 search results - page 124 / 293
» The Cost of Cache-Oblivious Searching
Sort
View
AINA
2009
IEEE
15 years 4 months ago
Document-Oriented Pruning of the Inverted Index in Information Retrieval Systems
Searching very large collections can be costly in both computation and storage. To reduce this cost, recent research has focused on reducing the size (pruning) of the inverted ind...
Lei Zheng, Ingemar J. Cox
ASPLOS
2011
ACM
14 years 10 months ago
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laur...
SIGMOD
2012
ACM
253views Database» more  SIGMOD 2012»
13 years 8 months ago
Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS) for on-line transaction processing (OLTP) applicatio...
Andrew Pavlo, Carlo Curino, Stanley B. Zdonik
ERCIMDL
2001
Springer
205views Education» more  ERCIMDL 2001»
15 years 11 months ago
Building and Indexing a Distributed Multimedia Presentation Archive Using SMIL
This paper proposes an approach to the problem of generating metadata for composite mixed-media digital objects by appropriately combining and exploiting existing knowledge or met...
Jane Hunter, Suzanne Little
ICWN
2008
15 years 7 months ago
Progressive Content-Sensitive Data Retrieval in Sensor Networks
: Problem statement: For a sensor network comprising autonomous and self-organizing data sources, efficient similarity-based search for semantic-rich resources (such as video data)...
Bo Yang, Mareboyana Manohar, Shaoying Kou