Sciweavers

910 search results - page 61 / 182
» Efficient retrieval of replicated data
Sort
View
DAGSTUHL
2004
14 years 11 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
HPDC
2010
IEEE
14 years 11 months ago
Efficient querying of distributed provenance stores
Current projects that automate the collection of provenance information use a centralized architecture for managing the resulting metadata - that is, provenance is gathered at rem...
Ashish Gehani, Minyoung Kim, Tanu Malik
KES
2005
Springer
15 years 3 months ago
Using Relevance Feedback to Learn Both the Distance Measure and the Query in Multimedia Databases
Much of the world’s data is in the form of time series, and many other types of data, such as video, image, and handwriting, can easily be transformed into time series. This fact...
Chotirat (Ann) Ratanamahatana, Eamonn J. Keogh
DCC
2007
IEEE
15 years 9 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
HPDC
2003
IEEE
15 years 3 months ago
PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities
Abstract. We present PlanetP, a peer-to-peer (P2P) content search and retrieval infrastructure targeting communities wishing to share large sets of text documents. P2P computing is...
Francisco Matias Cuenca-Acuna, Christopher Peery, ...