Mercury: supporting scalable multi-attribute range queries
By Ashwin R. Bharambe, Mukesh Agrawal, Srinivasan Seshan. Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, 2004
804 citations recorded by the source corpus.
Subfields: Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/4e29d549fb237c33f3035b46bdbd471da993f125
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- John Risson
- Tim Moors
- Yury Malkov
- François Taïani
- Bernard Wong
- Anne-Marie Kermarrec
- Aleksandrs Slivkins
- Eleonora Borgia
Citations in the corpus
- Scalable Distributed Algorithm for Approximate Nearest Neighbor Search Problem in High Dimensional General Metric Spaces (2012, methodology): “MAAN [24], SCRAP[25] , Mercury [26] support multi-dimensional range queries and Voronet [27] is p2p network oriented to search nearest neighbor in E2 based on Voronoi tessellation [8].”
- Meridian: a lightweight network location service without virtual coordinates (2005, background): “Peer-to-peer substrates that can naturally work with Euclidean coordinates and support range queries, such as CAN [46], Mercury [5] and P-Trees [13], can reduce the state requirements per node; however, these systems introduce substantial complexity and bandwidth overhead in addition to the overhead”
- Want to scale in centralized systems? Think P2P (2015, background): “Finally, a third line of extension adds additional querying capabilities, such as range queries [18, 19], by combining additional routing links, and well-chosen hash functions [20].”
- Delay aware querying with Seaweed (2006, neutral): “More recently, distributed indexes using various peer-to-peer structures have been designed [1, 6, 18, 27].”
- Survey of research towards robust peer-to-peer networks: Search methods (2006, methodology): “While it does not use hashing, Mercury is loosely similar to the DHT approaches: nodes within hubs are arranged into rings, like Chord [34]; for efficient routing within hubs, k long-distance links are used, like Symphony [339].”
- The Internet of Things vision: Key features, applications and open issues (2014, background): “Due to the environmental heterogeneity, service discovery for IoT will also be able to support flexible identification scheme, multi attribute query, or range query, and Prefix Hash Tree (PHT) [115], Mercury [116], MAAN [117], or Squid [118] can be contributing solutions to handle such a complex que”