Sciweavers

8349 search results - page 1451 / 1670
» Introduction to Information Retrieval
Sort
View
PODS
2006
ACM
216views Database» more  PODS 2006»
16 years 4 months ago
Cache-oblivious string B-trees
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
Michael A. Bender, Martin Farach-Colton, Bradley C...
EDBT
2004
ACM
172views Database» more  EDBT 2004»
16 years 4 months ago
Content-Based Routing of Path Queries in Peer-to-Peer Systems
Peer-to-peer (P2P) systems are gaining increasing popularity as a scalable means to share data among a large number of autonomous nodes. In this paper, we consider the case in whic...
Georgia Koloniari, Evaggelia Pitoura
EDBT
2008
ACM
194views Database» more  EDBT 2008»
16 years 4 months ago
XCraft: boosting the performance of active XML materialization
An active XML (AXML) document contains tags representing calls to Web services. Therefore, retrieving its contents consists in materializing its data elements by invoking the embe...
Gabriela Ruberg, Marta Mattoso
135
Voted
MOBIHOC
2006
ACM
16 years 4 months ago
Data storage placement in sensor networks
Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. This paper introduces stora...
Bo Sheng, Qun Li, Weizhen Mao
118
Voted
DCC
2007
IEEE
16 years 4 months ago
Nonuniform Compression in Databases with Haar Wavelet
Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the data from ...
S. Chen, A. Nucci
« Prev « First page 1451 / 1670 Last » Next »