Enhanced lookup queries for large-scale distributed data structures

DOI10.3233/978-1-60750-004-9-83MaRDI QIDQ3647318zbMATH OpenFDO

Authors Jordi Pujol-Ahulló, Pedro García López

Publication date 30 November 2009

Full work available at URL https://doi.org/10.3233/978-1-60750-004-9-83

zbMATH Keywords

parallel algorithmspeer-to-peer networksrange queriesspatial queries\(k\)-nearest neighboursimilarity queries

Mathematics Subject Classification ID

Data structures (68P05) Parallel algorithms in computer science (68W10) Distributed systems (68M14)

Recommendations

• SOFSEM 2005: Theory and Practice of Computer Science
• scientific article; zbMATH DE number 1931810
• Agents and Peer-to-Peer Computing
• Structured peer-to-peer systems. Fundamentals of hierarchical organization, routing, scaling, and security. Foreword by Ion Stoica.
• Multidimensional data querying on tree-structured overlay

Cited in

(3)

• SOFSEM 2005: Theory and Practice of Computer Science
• Efficient lookup on unstructured topologies
• scientific article; zbMATH DE number 1931810 (Why is no real title available?)

This page was built for publication: Enhanced lookup queries for large-scale distributed data structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3647318)