Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
EDUTELLA: a P2P networking infrastructure based on RDF
Proceedings of the 11th international conference on World Wide Web
Querying with Intrinsic Preferences
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Optimizing Multi-Feature Queries for Image Databases
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
On Real-Time Top k Querying for Mobile Services
On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
The chatty web: emergent semantics through gossiping
WWW '03 Proceedings of the 12th international conference on World Wide Web
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
Piazza: data management infrastructure for semantic web applications
WWW '03 Proceedings of the 12th international conference on World Wide Web
PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Evaluating Top-k Queries over Web-Accessible Databases
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
HyperCuP: hypercubes, ontologies, and efficient search on peer-to-peer networks
AP2PC'02 Proceedings of the 1st international conference on Agents and peer-to-peer computing
A framework for decentralized ranking in web information retrieval
APWeb'03 Proceedings of the 5th Asia-Pacific web conference on Web technologies and applications
Search strategies for scientific collaboration networks
Proceedings of the 2005 ACM workshop on Information retrieval in peer-to-peer networks
Efficient progressive processing of skyline queries in peer-to-peer systems
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Distributed spatio-temporal similarity search
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Top-k Monitoring in Wireless Sensor Networks
IEEE Transactions on Knowledge and Data Engineering
Efficient top-k processing in large-scaled distributed environments
Data & Knowledge Engineering
Web text retrieval with a P2P query-driven index
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Routing Queries through a Peer-to-Peer InfoBeacons Network Using Information Retrieval Techniques
IEEE Transactions on Parallel and Distributed Systems
Efficient Process of Top-k Range-Sum Queries over Multiple Streams with Minimized Global Error
IEEE Transactions on Knowledge and Data Engineering
Best position algorithms for top-k queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Region clustering based evaluation of multiple top-N selection queries
Data & Knowledge Engineering
Zerber: r-confidential indexing for distributed documents
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
POT: an efficient top-k monitoring method for spatially correlated sensor readings
Proceedings of the 5th workshop on Data management for sensor networks
Designing a Peer-to-Peer Architecture for Distributed Image Retrieval
Adaptive Multimedial Retrieval: Retrieval, User, and Semantics
Optimizing Distributed Top-k Queries
WISE '08 Proceedings of the 9th international conference on Web Information Systems Engineering
Alternatives to conjunctive query processing in peer-to-peer file-sharing systems
Proceedings of the 2009 ACM symposium on Applied Computing
Finding the K highest-ranked answers in a distributed network
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed top-k aggregation queries at large
Distributed and Parallel Databases
Aggregation of Document Frequencies in Unstructured P2P Networks
WISE '09 Proceedings of the 10th International Conference on Web Information Systems Engineering
Processing top-N relational queries by learning
Journal of Intelligent Information Systems
Towards efficient ranked query processing in peer-to-peer networks
Proceedings of the 2005 joint Chinese-German conference on Cognitive systems
Database selection and result merging in P2P web search
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
PCIR: Combining DHTs and peer clusters for efficient full-text P2P indexing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Top-k vectorial aggregation queries in a distributed environment
Journal of Parallel and Distributed Computing
An access cost-aware approach for object retrieval over multiple sources
Proceedings of the VLDB Endowment
Distributed threshold querying of general functions by a difference of monotonic representation
Proceedings of the VLDB Endowment
Power efficiency through tuple ranking in wireless sensor network monitoring
Distributed and Parallel Databases
Best position algorithms for efficient top-k query processing
Information Systems
Peer-to-peer web search: euphoria, achievements, disillusionment, and future opportunities
From active data management to event-based systems and more
Distributed SQL queries with BubbleStorm
From active data management to event-based systems and more
Efficient approximate top-k query algorithm using cube index
APWeb'11 Proceedings of the 13th Asia-Pacific web conference on Web technologies and applications
Efficient distributed top-k query processing with caching
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
Efficient early top-k query processing in overloaded P2P systems
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
TOP-k query calculation in peer-to-peer networks
ASIAN'05 Proceedings of the 10th Asian Computing Science conference on Advances in computer science: data management on the web
Searching dynamic communities with personal indexes
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Optimizing peer virtualization and load balancing
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Efficient non-blocking top-k query processing in distributed networks
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Approximate top-k queries in sensor networks
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
A peer-to-peer architecture for information retrieval across digital library collections
ECDL'06 Proceedings of the 10th European conference on Research and Advanced Technology for Digital Libraries
Efficient processing of distributed top-k queries
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
Supporting efficient distributed top-k monitoring
WAIM '06 Proceedings of the 7th international conference on Advances in Web-Age Information Management
Towards a common framework for peer-to-peer web retrieval
From Integrated Publication and Information Systems to Virtual Information and Knowledge Environments
DL meets p2p – distributed document retrieval based on classification and content
ECDL'05 Proceedings of the 9th European conference on Research and Advanced Technology for Digital Libraries
Community based ranking in peer-to-peer networks
OTM'05 Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, COA, and ODBASE - Volume Part II
Innovative information and knowledge infrastructures – how do i find what i need?
ADVIS'06 Proceedings of the 4th international conference on Advances in Information Systems
Peer-to-Peer Information Retrieval: An Overview
ACM Transactions on Information Systems (TOIS)
Distributed top-k query processing by exploiting skyline summaries
Distributed and Parallel Databases
On saying "enough already!" in MapReduce
Proceedings of the 1st International Workshop on Cloud Intelligence
Processing top-k queries in distributed hash tables
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
As-Soon-As-Possible top-k query processing in p2p systems
Transactions on Large-Scale Data- and Knowledge-centered systems IX
Hi-index | 0.00 |
Query processing in traditional information management systems has moved from an exact match model to more flexible paradigms allowing cooperative retrieval by aggregating the database objectsý degree of match for each different query predicate and returning the best matching objects only. In peer-to-peer systems such strategies are even more important, given the potentially large number of peers, which may contribute to the results. Yet current peer-to-peer research has barely started to investigate such approaches. In this paper we will discuss the benefits of best match/top-k queries in the context of distributed peer-to-peer information infrastructures and show how to extend the limited query processing in current peer-to-peer networks by allowing the distributed processing of top-k queries, while maintaining a minimum of data traffic. Relying on a super-peer backbone organized in the HyperCuP topology we will show how to use local indexes for optimizing the necessary query routing and how to process intermediate results in inner network nodes at the earliest possible point in time cutting down the necessary data traffic within the network. Our algorithm is based on dynamically collected query statistics only, no continuous index update processes are necessary, allowing it to scale easily to large numbers of peers, as well as dynamic additions/deletions of peers. We will show our approach to always deliver correct result sets and to be optimal in terms of necessary object accesses and data traffic. Finally, we present simulation results for both static and dynamic network environments.