Adaptive selectivity estimation using query feedback
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Fuzzy queries in multimedia database systems
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Optimal multi-step k-nearest neighbor search
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
The onion technique: indexing for linear optimization queries
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
PREFER: a system for the efficient execution of multi-parametric ranked queries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Efficient Semantic-Based Content Search in P2P Network
IEEE Transactions on Knowledge and Data Engineering
Mercury: supporting scalable multi-attribute range queries
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Progressive skyline computation in database systems
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
iDistance: An adaptive B+-tree based indexing method for nearest neighbor search
ACM Transactions on Database Systems (TODS)
BATON: a balanced tree structure for peer-to-peer networks
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Toward Efficient Multifeature Query Processing
IEEE Transactions on Knowledge and Data Engineering
VBI-Tree: A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
M-Chord: a scalable distributed similarity search structure
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Towards robust indexing for ranked queries
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Answering top-k queries with multi-dimensional selections: the ranking cube approach
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Branch-and-bound processing of ranked queries
Information Systems
A large-scale evaluation and analysis of personalized search strategies
Proceedings of the 16th international conference on World Wide Web
Progressive and selective merge: computing top-k with ad-hoc ranking functions
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Distributed Density Estimation Using Non-parametric Statistics
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
On efficient top-k query processing in highly distributed environments
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Skyframe: a framework for skyline query processing in peer-to-peer systems
The VLDB Journal — The International Journal on Very Large Data Bases
Skyline-based Peer-to-Peer Top-k Query Processing
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Efficient Skyline Computation in Structured Peer-to-Peer Systems
IEEE Transactions on Knowledge and Data Engineering
Multi-dimensional data density estimation in P2P networks
Distributed and Parallel Databases
Processing generalized k-nearest neighbor queries on a wireless broadcast stream
Information Sciences: an International Journal
A multi-path QoS multicast routing protocol with slot assignment for mobile ad hoc networks
Information Sciences: an International Journal
Effective Data Density Estimation in Ring-Based P2P Networks
ICDE '12 Proceedings of the 2012 IEEE 28th International Conference on Data Engineering
Information Sciences: an International Journal
Skyline queries on keyword-matched data
Information Sciences: an International Journal
Hi-index | 0.07 |
Personalized query evaluation which returns top-k results according to users' individual interests was once confined mainly to the web literature, while now it is increasingly becoming a factor in many other search systems, such as peer-to-peer systems, cloud computing systems etc. In this paper, we propose a novel method for efficient personalized query processing in P2P systems. The problem has never been discussed and remains imperative to be solved. By effectively calculating a corresponding search range on-the-fly which contains the dedicated top-k results based on the estimated multiscale data density in the current system, a personalized query is transformed into a special range query for efficient processing at run time. Singular value decomposition of the personalization matrix is deployed to simplify the process of range computation. Search request is then multicasted within the desired range, which optimizes the communication cost when fetching those results in the P2P network. Algorithms on multiscale density estimation, range computation and multicast routing are given as well as the theoretical analysis. Our extensive performance study confirms the effectiveness and efficiency of our method.