61,364 Hits in 5.4 sec

Routing of structured queries in large-scale distributed systems

Judith Winter
2008 Proceeding of the 2008 ACM workshop on Large-Scale distributed systems for information retrieval - LSDS-IR '08  
In this paper, we concentrate on query routing in such a scenario and raise the question, how structured queries can be routed in a highly distributed environment so as to increase both efficiency and  ...  None have ever been applied to improve retrieval in large-scale distributed systems such as Peer-to-Peer (P2P) networks, where efficiency issues have to be dealt with carefully, e.g. in order to reduce  ...  These results indicate that structural hints might indeed help to route queries in large-scale P2P systems.  ... 
doi:10.1145/1458469.1458482 dblp:conf/cikm/Winter08 fatcat:5uvddjss2vh2jhx5gfqv2aovfu

Workshop on large-scale distributed systems for information retrieval

Sebastian Michel, Gleb Skobeltsyn, Wai Gen Yee
2009 SIGIR Forum  
The 2008 edition of the Workshop on Large-Scale Distributed Systems for Information Retrieval (LSDS-IR'08) provided a forum for researchers to discuss these problems and to define new directions for the  ...  The Workshop program featured research contributions in the areas of similarity search, resource selection, network organization schemes, issues of data quality, result ranking techniques and query routing  ...  Judith Winter: "Routing of Structured Queries in Large-Scale Distributed Systems" [12];  ... 
doi:10.1145/1670598.1670606 fatcat:vwr3unmtgvbp3amzzbslmb5aq4

Distributed Search and Pattern Matching [chapter]

Reaz Ahmed, Raouf Boutaba
2009 Handbook of Peer-to-Peer Networking  
This chapter highlights the search requirements in large scale distributed systems and the ability of the existing distributed search techniques in satisfying these requirements.  ...  Despite of the diversity in application, these systems share common requirements for searching due to transitory nodes population and content volatility.  ...  In other words, uniform distribution of load may result into poor system performance in a large scale distributed system.  ... 
doi:10.1007/978-0-387-09751-0_16 fatcat:tnzjpctglvbcfmtdo5gsxr2o3i

Structured P2P technologies for distributed command and control

Daniel R. Karrels, Gilbert L. Peterson, Barry E. Mullins
2009 Peer-to-Peer Networking and Applications  
It provides a detailed survey of fundamental design approaches found in modern large-scale P2P systems highlighting design considerations for building and deploying scalable P2P applications.  ...  This paper provides an overview of how P2P systems are capable of providing robust command and control for Distributed Multi-Agent Systems (DMASs).  ...  While these systems are designed for performance in smaller systems, large-scale systems will suffer an indirect negative impact at the expense of route length.  ... 
doi:10.1007/s12083-009-0033-y fatcat:ax5ihdfzfrhqjjqjvcqz266ome

Supporting arbitrary queries in peer-to-peer networks using hybrid routing

Vivek Sawant, Jasleen Kaur
2005 Proceedings of the twentieth ACM symposium on Operating systems principles - SOSP '05  
In our work, we design a P2P lookup system that combines the strengths of structured and unstructured routing to efficiently support both precise and imprecise queries.  ...  The system uses a structured routing based mechanism for precise queries.  ...  In our work, we design a P2P lookup system that combines the strengths of structured and unstructured routing to efficiently support both precise and imprecise queries.  ... 
doi:10.1145/1095810.1118592 fatcat:cuov4drg5nhbffpgdlak3i5h4y

Efficient Management of Multidimensional Data in Structured Peer-to-peer Overlays

Djelloul Boukhelef, Hiroyuki Kitagawa
2009 Very Large Data Bases Conference  
In this paper we propose a new scalable and distributed indexing structure for managing multidimensional data in dynamic P2P systems.  ...  The key idea is to equip each node with long links towards some distant nodes in the system such that a message moves faster to its target during routing, while the cost of maintaining the network during  ...  This research is partly supported by Grant-in-Aid from MEXT 21013004, Japan.  ... 
dblp:conf/vldb/BoukhelefK09 fatcat:6zwwa47t3vajhhepvy5ckr6faa

Efficient Processing of XPath Queries with Structured Overlay Networks [chapter]

Gleb Skobeltsyn, Manfred Hauswirth, Karl Aberer
2005 Lecture Notes in Computer Science  
In this paper we present a first solution for efficiently supporting structured queries, more specifically, XPath queries, in structured P2P systems.  ...  Though the use of a distributed index (typically a distributed hash table) makes the implementation of structured queries more efficient, it also introduces considerable complexity, and thus only a few  ...  Conclusions In this paper we presented the efficient solution for indexing structural information in a structured overlay network used as distributed P2P storage of XML documents.  ... 
doi:10.1007/11575801_20 fatcat:i6q2wdwwjjdt3kpykyjyowevl4

The Management Strategy of Metadata in Large-scale Network Storage System

Haifeng Zhong, Jianying Xiong, G. Lee
2018 MATEC Web of Conferences  
However, such systems work in highly dynamic environments, and the frequent entry and exit of nodes will lead to huge communication costs.  ...  The wan Internet storage system based on Distributed Hash Table uses fully distributed data and metadata management, and constructs an extensible and efficient mass storage system for the application based  ...  Thus, recently large-scale network storage systems based on structured overlay networks and distributed hash tables have become a new trend in the development of distributed storage technologies [5] .  ... 
doi:10.1051/matecconf/201822801011 fatcat:sb43vyut75aandovumi7kzgkyi

SARIDS: A Self-Adaptive Resource Index and Discovery System

Yi-Hsiang Lin, Wu-Chun Chung, Kuan-Chou Lai, Kuan-Ching Li, Yeh-Ching Chung
2009 2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks  
scale distributed system.  ...  However, due to the heterogeneity of resources and the variation of sharing policies in different providers, current P2P-based resource discovery systems may suffer the load imbalance problem in a large  ...  ACKNOWLEDGMENT This work is partially supported by National Science Council of the Republic of China under contract NSC 96-2221-E-007-130-MY3 and NSC 97-3114-E-007-001.  ... 
doi:10.1109/i-span.2009.21 dblp:conf/ispan/LinCLLC09 fatcat:gqrykm6dczfgbegsgt4frrtvzq

Toward network data independence

Joseph M. Hellerstein
2003 SIGMOD record  
A number of researchers have become interested in the design of global-scale networked systems and applications.  ...  We present a sampling of database query processing techniques that can contribute in this arena, and discuss methods for adoption of these technologies.  ...  Introduction A number of research communities are now investigating the design of global-scale networked systems made up of a very large, relatively volatile mix of participating compute resources.  ... 
doi:10.1145/945721.945730 fatcat:gd3g37dl2zb25g7vymqof4wbnm

A Scalable Server for 3D Metaverses

Ewen Cheslack-Postava, Tahir Azim, Behram F. T. Mistree, Daniel Reiter Horn, Jeff Terrace, Philip Levis, Michael J. Freedman
2012 USENIX Annual Technical Conference  
It achieves both goals simultaneously by leveraging properties of the real world and 3D environments in its core systems, such as a novel distributed data structure for virtual object queries based on  ...  Current metaverses impose this distance restriction on visibility and interaction in order to scale to large worlds, as the restriction avoids appreciable shared state in underlying distributed systems  ...  This work is funded by the National Science Foundation (NeTS-ANET Grants #0831163 and #0831374) and conducted in conjunction with the Intel Science and Technology Center -Visual Computing.  ... 
dblp:conf/usenix/Cheslack-PostavaAMHTLF12 fatcat:zvidrujth5g27m2wrtv7ldhrde

Efficient query routing in distributed spatial databases

Roger Zimmermann, Wei-Shinn Ku, Wei-Cheng Chu
2004 Proceedings of the 12th annual ACM international workshop on Geographic information systems - GIS '04  
distributed access structure and routing middleware for spatial queries.  ...  In this study we present our middleware design based on distributed R-tree and Quadtree index structures. Importantly, the framework supports both spatial range and k nearest neighbor queries.  ...  RELATED WORK Recently, considerable attention has focused on an emerging class of large scale distributed data management systems classified as peer-to-peer (P2P) systems.  ... 
doi:10.1145/1032222.1032249 dblp:conf/gis/ZimmermannKC04 fatcat:vfhyjqmd3zas3mazsxmjddjt7e

MAAN: A Multi-Attribute Addressable Network for Grid Information Services

Min Cai, Martin Frank, Jinbo Chen, Pedro Szekely
2004 Journal of Grid Computing  
Recent structured Peer-to-Peer (P2P) systems such as Distributed Hash Tables (DHTs) offer scalable key-based lookup for distributed resources.  ...  It uses an iterative or single attribute dominated query routing algorithm to resolve multi-attribute based queries. Each node in MAAN only has O(log N) neighbors for N nodes.  ...  We thank Ramesh Govindan for helpful discussions, and Baoshi Yan for contributing the single-attribute-dominated query resolution idea.  ... 
doi:10.1007/s10723-004-1184-y fatcat:zynrar53lrh3flxgephwqg6veu

Enhancing the P2P Protocols to Support Advanced Multi-keyword Queries [chapter]

Samir Ghamri-Doudane, Nazim Agoulmine
2006 Lecture Notes in Computer Science  
Also, more efficient systems based on distributed hash tables (DHT) lack in query expressiveness and flexibility.  ...  This paper addresses this issue by discussing existing solutions, and proposing a novel approach to support advanced multi-keyword queries in the context of Peer-to-Peer systems.  ...  This approach allows the deployment of distributed systems in large-scale and dynamic networks.  ... 
doi:10.1007/11753810_53 fatcat:nn32h3rexbc4daeziwh4xuyr4q

Looking up data in P2P systems

Hari Balakrishnan, M. Frans Kaashoek, David Karger, Robert Morris, Ion Stoica
2003 Communications of the ACM  
43 Systems T he main challenge in P2P computing is to design and implement a robust and scalable distributed system composed of inexpensive, individually unreliable computers in unrelated administrative  ...  The participants in a typical P2P system might include computers at homes, schools, and businesses, and can grow to several million concurrent participants.  ...  With more work, DHTs might well prove to be a valuable building block for robust, large-scale distributed applications on the Internet.  ... 
doi:10.1145/606272.606299 fatcat:6jm6jzo4rjcf5clj52nzq4coce
« Previous Showing results 1 — 15 out of 61,364 results