Swarm intelligence: from natural to artificial systems
Swarm intelligence: from natural to artificial 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
A new approach to scalable Linda-systems based on swarms
Proceedings of the 2003 ACM symposium on Applied computing
RDFPeers: a scalable distributed RDF repository based on a structured peer-to-peer network
Proceedings of the 13th international conference on World Wide Web
Load balancing and locality in range-queriable data structures
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Using a distributed quadtree index in peer-to-peer networks
The VLDB Journal — The International Journal on Very Large Data Bases
GridVine: An Infrastructure for Peer Information Management
IEEE Internet Computing
A self-organized semantic storage service
Proceedings of the 12th International Conference on Information Integration and Web-based Applications & Services
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
The 2012 international workshop on web-scale knowledge representation, retrieval, and reasoning
Proceedings of the 21st ACM international conference on Information and knowledge management
| Hi-index | 0.00 |
Distributed solutions for the storage and retrieval of large amounts of data are necessary to handle the growing amounts of knowledge expected from future applications. The support for range queries provides much-needed expressivity, for example for queries on data annotated with location and time. We present a novel and scalable way for range query evaluation in our distributed storage system based on behaviour found in ants. Routing decisions in this system are taken on the basis of virtual pheromone paths leading from one node to another node, distinct for different data items. Range queries for single ranges can be evaluated by checking the pheromone paths for the entire range and forking the operation to several nodes if necessary. An aggregation method ensures the efficiency of the routing operations. We have evaluated our approach using a synthetic data set stored on 100 nodes, and executed various range queries while recording the amount of nodes involved along with the size of the result set.