Date
2007
Collection title
Lecture Notes in Computer Science
Collection Id
4125
Dewey
Organisation des données
Sujet
SDDS
Conference name
Databases, Information Systems, and Peer-to-Peer Computing International Workshops, DBISP2P 2005/2006
Conference date
09-2006
Conference city
Seoul
Conference country
Corée du Sud
Book title
Databases, Information Systems, and Peer-to-Peer Computing International Workshops, DBISP2P 2005/2006, Trondheim, Norway, August 28-29, 2005, Seoul, Korea, September 11, 2006, Revised Selected Papers
Author
Moro, Gianluca; Bergamaschi, Sonia; Joseph, Sam; Morin, Jean-Henry; Ouksel, Aris M.
Publisher
Springer
Publisher city
Berlin
Year
2007
Pages number
418
ISBN
978-3-540-71660-0
Author
Litwin, Witold
Mokadem, Riad
Schwarz, Thomas
Type
Communication / Conférence
Item number of pages
155-162
Abstract (EN)
Scalable Distributed Data Structures (SDDS) are a class of data structures for multicomputers (a distributed system of networked computers) that allow data access by key in constant time (independent of the number of nodes in the multicomputer) and parallel search of the data. In order to speed up the parallel search of the data fields of the records, we propose to encode the records of a Scalable Distributed Data Structure (SDDS) using pre-computed algebraic signatures. The encoding / decoding overhead is linear in the size of the records. It speeds up prefix searches, longest prefix matches, and string searches. In addition, the encoding protects the privacy of the SDDS data against the owners of the workstations that make up the multicomputer. Additional encoding protects the integrity of the data against malfunctions.
