k-RP*{sub s}: A scalable distributed data structure for high-performance multi-attribute access
Conference
·
OSTI ID:535547
- Universite Paris (France)
- Hewlett-Packard Labs., Palo Alto, CA (United States)
k-RP*{sub s} is a new data structure for scalable multicomputer files with multi-attribute (k-d) keys. We discuss the k-RP*{sub s} file evolution and search algorithms. Performance analysis shows that a k-RP*{sub s} file can be much larger and orders of magnitude faster than a traditional k-d file. The speed-up is especially important for range and partial match searches that are often impractical with traditional k-d files. This opens up a new perspective for many applications.
- OSTI ID:
- 535547
- Report Number(s):
- CONF-961209--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel access to files in the Vesta file system
The Scalable Checkpoint/Restart Library
Observation of D sub s sup + r arrow K sup 0 K sup + and D sub s sup + r arrow K sup 0 K sup + and an upper limit on D sub s sup + r arrow K sup 0. pi. sup +
Conference
·
Thu Dec 30 23:00:00 EST 1993
·
OSTI ID:46243
The Scalable Checkpoint/Restart Library
Software
·
Sun Feb 22 19:00:00 EST 2009
·
OSTI ID:code-1155
Observation of D sub s sup + r arrow K sup 0 K sup + and D sub s sup + r arrow K sup 0 K sup + and an upper limit on D sub s sup + r arrow K sup 0. pi. sup +
Journal Article
·
Mon Sep 18 00:00:00 EDT 1989
· Physical Review Letters; (USA)
·
OSTI ID:5461965