An Eigendecomposition Approach to Weighted Graph Matching Problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
Multidimensional access methods
ACM Computing Surveys (CSUR)
Direct spatial search on pictorial databases using packed R-trees
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
STR: A Simple and Efficient Algorithm for R-Tree Packing
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Routing Indices For Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Efficient search in unstructured peer-to-peer networks
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
One torus to rule them all: multi-dimensional queries in P2P systems
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
VBI-Tree: A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
SRI: exploiting semantic information for effective query routing in a PDMS
WIDM '06 Proceedings of the 8th annual ACM international workshop on Web information and data management
Processing relaxed skylines in PDMS using distributed data summaries
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Associative search in peer to peer networks: Harnessing latent semantics
Computer Networks: The International Journal of Computer and Telecommunications Networking
P-ring: an efficient and robust P2P range index structure
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Optimizing Peer Relationships in a Super-Peer Network
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Peer-to-peer similarity search in metric spaces
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Summary management in P2P systems
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
On efficient top-k query processing in highly distributed environments
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Distance browsing in distributed multimedia databases
Future Generation Computer Systems
Scalable multi-query optimization for exploratory queries over federated scientific databases
Proceedings of the VLDB Endowment
Efficient range query processing in metric spaces over highly distributed data
Distributed and Parallel Databases
Maintenance strategies for routing indexes
Distributed and Parallel Databases
Multidimensional routing indices for efficient distributed query processing
Proceedings of the 18th ACM conference on Information and knowledge management
On using histograms as routing indexes in peer-to-peer systems
DBISP2P'04 Proceedings of the Second international conference on Databases, Information Systems, and Peer-to-Peer Computing
DESENT: decentralized and distributed semantic overlay generation in P2P networks
IEEE Journal on Selected Areas in Communications
Adaptive parallel approximate similarity search for responsive multimedia retrieval
Proceedings of the 20th ACM international conference on Information and knowledge management
| Hi-index | 0.02 |
Recently, the problem of efficiently supporting advanced query operators, such as nearest neighbor or range queries, over multidimensional data in widely distributed environments has attracted much attention. In unstructured peer-to-peer (P2P) networks, peers store data in an autonomous manner, thus multidimensional routing indices (MRI) are required, in order to route user queries efficiently to only those peers that may contribute to the query result set. Focusing on a hybrid unstructured P2P network, in this paper, we analyze the parameters for building MRI of high selectivity. In the case where similar data are located at different parts of the network, MRI exhibit extremely poor performance, which renders them ineffective. We present algorithms that boost the query routing performance by detecting similar peers and reassigning these peers to other parts of the hybrid network in a distributed and scalable way. The resulting MRI are able to eagerly discard routing paths during query processing. We demonstrate the advantages of our approach experimentally and show that our framework enhances a state-of-the-art approach for similarity search in terms of reduced network traffic and number of contacted peers.