{"_id":{"_str":"5342276aecd21cdc0700080f"},"__v":247,"authorIDs":["5456fbd98b01c819300000dc","5457d2042abc8e9f3700078f","5467199cbc7d6a460d000b72","7x83pdAZCjgDXS4pB","WY8dCWsDcxhomeQyJ"],"author_short":["Cai, M.","Frank, M.","Chen, J.","Szekely, P."],"bibbaseid":"cai-frank-chen-szekely-maanamultiattributeaddressablenetworkforgridinformationservices-2003","bibdata":{"bibtype":"inproceedings","type":"inproceedings","abstract":"Recent structured peer-to-peer (P2P) systems such as distributed hash tables (DHTs) offer scalable key-based lookup for distributed resources. However, they cannot be simply applied to grid information services because grid resources need to be registered and searched using multiple attributes. We propose a multiattribute addressable network (MAAN) which extends chord to support multiattribute and range queries. MAAN addresses range queries by mapping attribute values to the chord identifier space via uniform locality preserving hashing. It uses an iterative or single attribute dominated query routing algorithm to resolve multiattribute based queries. Each node in MAAN only has O(logN) neighbors for N nodes. The number of routing hops to resolve a multiattribute range query is O(logN+N times;smin), where smin is the minimum range selectivity on all attributes. When smin= #949;, it is logarithmic to the number of nodes, which is scalable to a large number of nodes and attributes. We also measured the performance of our MAAN implementation and the experimental results are consistent with our theoretical analysis.","author":[{"firstnames":["Min"],"propositions":[],"lastnames":["Cai"],"suffixes":[]},{"firstnames":["Martin"],"propositions":[],"lastnames":["Frank"],"suffixes":[]},{"firstnames":["Jinbo"],"propositions":[],"lastnames":["Chen"],"suffixes":[]},{"firstnames":["Pedro"],"propositions":[],"lastnames":["Szekely"],"suffixes":[]}],"date-modified":"2010-09-16 23:48:03 -0700","journal":"Grid Computing, 2003. Proceedings. Fourth International Workshop on","keywords":"DHT; MAAN; P2P; chord identifier; distributed hash table; grid information services; multiattribute addressable network; peer-to-peer system; query routing algorithm; grid computing; information services; query processing; storage allocation; table lookup;","month":"nov.","pages":"184 - 191","title":"MAAN: a multi-attribute addressable network for grid information services","urlpaper":"http://www.isi.edu/~szekely/contents/papers/2003/maanIeee2003.pdf","year":"2003","bibtex":"@inproceedings{Cai:2003,\n\tAbstract = {Recent structured peer-to-peer (P2P) systems such as distributed hash tables (DHTs) offer scalable key-based lookup for distributed resources. However, they cannot be simply applied to grid information services because grid resources need to be registered and searched using multiple attributes. We propose a multiattribute addressable network (MAAN) which extends chord to support multiattribute and range queries. MAAN addresses range queries by mapping attribute values to the chord identifier space via uniform locality preserving hashing. It uses an iterative or single attribute dominated query routing algorithm to resolve multiattribute based queries. Each node in MAAN only has O(logN) neighbors for N nodes. The number of routing hops to resolve a multiattribute range query is O(logN+N times;smin), where smin is the minimum range selectivity on all attributes. When smin= #949;, it is logarithmic to the number of nodes, which is scalable to a large number of nodes and attributes. We also measured the performance of our MAAN implementation and the experimental results are consistent with our theoretical analysis.},\n\tAuthor = {Min Cai and Martin Frank and Jinbo Chen and Pedro Szekely},\n\tDate-Modified = {2010-09-16 23:48:03 -0700},\n\tJournal = {Grid Computing, 2003. Proceedings. Fourth International Workshop on},\n\tKeywords = {DHT; MAAN; P2P; chord identifier; distributed hash table; grid information services; multiattribute addressable network; peer-to-peer system; query routing algorithm; grid computing; information services; query processing; storage allocation; table lookup;},\n\tMonth = {nov.},\n\tPages = {184 - 191},\n\tTitle = {MAAN: a multi-attribute addressable network for grid information services},\n\tUrlpaper = {http://www.isi.edu/~szekely/contents/papers/2003/maanIeee2003.pdf},\n\tYear = {2003}}\n\n","author_short":["Cai, M.","Frank, M.","Chen, J.","Szekely, P."],"key":"Cai:2003","id":"Cai:2003","bibbaseid":"cai-frank-chen-szekely-maanamultiattributeaddressablenetworkforgridinformationservices-2003","role":"author","urls":{"Paper":"http://www.isi.edu/~szekely/contents/papers/2003/maanIeee2003.pdf"},"keyword":["DHT; MAAN; P2P; chord identifier; distributed hash table; grid information services; multiattribute addressable network; peer-to-peer system; query routing algorithm; grid computing; information services; query processing; storage allocation; table lookup;"],"metadata":{"authorlinks":{"szekely, p":"https://usc-isi-i2.github.io/"}}},"bibtype":"inproceedings","biburl":"www.isi.edu/~szekely/contents/szekely_bib.bib","downloads":0,"keywords":["dht; maan; p2p; chord identifier; distributed hash table; grid information services; multiattribute addressable network; peer-to-peer system; query routing algorithm; grid computing; information services; query processing; storage allocation; table lookup;"],"search_terms":["maan","multi","attribute","addressable","network","grid","information","services","cai","frank","chen","szekely"],"title":"MAAN: a multi-attribute addressable network for grid information services","year":2003,"dataSources":["kJHZJNqDYzzxrNuWu","28D8KWKqxPjuRtpxg"]}