Concept formation in structured domains
Concept formation knowledge and experience in unsupervised learning
Latent semantic indexing: a probabilistic analysis
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Fuzzy sets as a basis for a theory of possibility
Fuzzy Sets and Systems
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
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
SAINTETIQ: a fuzzy set-based approach to database summarization
Fuzzy Sets and Systems - Data bases and approximate reasoning
Comparing Hybrid Peer-to-Peer Systems
Proceedings of the 27th International Conference on Very Large Data Bases
Locating Data in (Small-World?) Peer-to-Peer Scientific Collaborations
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
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
Routing Indices For Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
The Piazza peer data management project
ACM SIGMOD Record
Evaluating GUESS and Non-Forwarding Peer-to-Peer Search
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Efficient Semantic-Based Content Search in P2P Network
IEEE Transactions on Knowledge and Data Engineering
General purpose database summarization
VLDB '05 Proceedings of the 31st international conference on Very large data bases
DiCAS: An Efficient Distributed Caching Mechanism for P2P Systems
IEEE Transactions on Parallel and Distributed Systems
Merging distributed database summaries
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Multidimensional routing indices for efficient distributed query processing
Proceedings of the 18th ACM conference on Information and knowledge management
On the selectivity of multidimensional routing indices
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
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
Processing fuzzy queries in a peer data management system using distributed fuzzy summaries
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
Network-aware summarisation for resource discovery in P2P-content networks
Future Generation Computer Systems
| Hi-index | 0.00 |
Sharing huge, massively distributed databases in P2P systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer sufficient. A practical approach is to rely on compact database summaries rather than raw database records, whose access is costly in large P2P systems. In this paper, we consider summaries that are synthetic, multidimensional views with two main virtues. First, they can be directly queried and used to approximately answer a query without exploring the original data. Second, as semantic indexes, they support locating relevant nodes based on data content. Our main contribution is to define a summary model for P2P systems, and the appropriate algorithms for summary management. Our performance evaluation shows that the cost of query routing is minimized, while incurring a low cost of summary maintenance.