Please use this identifier to cite or link to this item:
|Title:||Paths to stardom: Calibrating the potential of a peer-based data management system||Authors:||Lupu, M.
|Issue Date:||2008||Citation:||Lupu, M.,Ooi, B.C.,Tay, Y.C. (2008). Paths to stardom: Calibrating the potential of a peer-based data management system. Proceedings of the ACM SIGMOD International Conference on Management of Data : 265-278. ScholarBank@NUS Repository. https://doi.org/10.1145/1376616.1376646||Abstract:||As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database applications. Indexing methods are adapted on top of P2P networks and querying methods are developed to handle the data distribution on different nodes. These procedures largely depend on how^ nodes are connected to each other. So far, limited attempts have been made to compare all these systems in a generalized framework. This is because the systems are quite different from each other, and there are so many of them that brute force comparison is practically impossible. Fortunately, it has recently been observed that a large subset of the most important P2P networks share a common algebraic and combinatorial base, in the form of Cayley graphs. The specific requirements of Peer-based Data Management Systems (PDMS), such as queryr completeness, range queries, load balancing, communication overhead, and scalability are strongly related to the properties of the underlying graphs, and naturally, some graphs are better than others. We conduct a comprehensive graph-theoretic analysis from the point of view of PDMS and identify the necessary conditions for a graph to be considered a potential network structure for a PDMS. In so doing, we provide a basis for the future development of such networks. We complement our analytical study with extensive experimental results and identify three measures that provide significant information about the potential of a [Cayley] graph to support the requirements of a PDMS. Copyright 2008 ACM.||Source Title:||Proceedings of the ACM SIGMOD International Conference on Management of Data||URI:||http://scholarbank.nus.edu.sg/handle/10635/43211||ISBN:||9781605581026||ISSN:||07308078||DOI:||10.1145/1376616.1376646|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 23, 2019
checked on May 23, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.