Sciweavers

55 search results - page 1 / 11
» Multidimensional routing indices for efficient distributed q...
Sort
View
CIKM
2009
Springer
13 years 9 months ago
Multidimensional routing indices for efficient distributed query processing
Traditional routing indices in peer-to-peer (P2P) networks are mainly designed for document retrieval applications and maintain aggregated one-dimensional values representing the ...
Christos Doulkeridis, Akrivi Vlachou, Kjetil N&osl...
CIKM
2010
Springer
13 years 4 months ago
On the selectivity of multidimensional routing indices
Recently, the problem of efficiently supporting advanced query operators, such as nearest neighbor or range queries, over multidimensional data in widely distributed environments...
Christos Doulkeridis, Akrivi Vlachou, Kjetil N&osl...
DEXA
2005
Springer
80views Database» more  DEXA 2005»
13 years 11 months ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu
P2P
2006
IEEE
101views Communications» more  P2P 2006»
13 years 11 months ago
Reinforcement Learning for Query-Oriented Routing Indices in Unstructured Peer-to-Peer Networks
The idea of building query-oriented routing indices has changed the way of improving routing efficiency from the basis as it can learn the content distribution during the query r...
Cong Shi, Shicong Meng, Yuanjie Liu, Dingyi Han, Y...
CIKM
2006
Springer
13 years 7 months ago
Processing relaxed skylines in PDMS using distributed data summaries
Peer Data Management Systems (PDMS) are a natural extension of heterogeneous database systems. One of the main tasks in such systems is efficient query processing. Insisting on co...
Katja Hose, Christian Lemke, Kai-Uwe Sattler