Cumulative algebraic signatures for fast string search, protection against incidental viewing and corruption of data in an SDDS

Authors:
Witold Litwin;Riad Mokadem;Thomas Schwarz
Affiliations:
Université Paris Dauphine, Centre d'Études et de Recherches en Informatique Appliquée,, Paris cedex 16, France;Université Paris Dauphine, Centre d'Études et de Recherches en Informatique Appliquée,, Paris cedex 16, France;Department of Computer Engineering, Santa Clara University, Santa Clara, CA
Venue:
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
Year:
2005

Citing 12
Cited 0

The cost of messages

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
LH*—a scalable, distributed data structure

ACM Transactions on Database Systems (TODS)
Off-line serial exact string searching

Pattern matching algorithms
Implementation of the substring test by hashing

Communications of the ACM
Trie hashing

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
RP*: A Family of Order Preserving Scalable Distributed Data Structures

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Algebraic Signatures for Scalable Distributed Data Structures

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Efficient randomized pattern-matching algorithms

IBM Journal of Research and Development - Mathematics and computing
Disk Scrubbing in Large Archival Storage Systems

MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
LZgrep: a Boyer–Moore string matching tool for Ziv–Lempel compressed text: Research Articles

Software—Practice & Experience
Linear hashing: a new tool for file and table addressing

VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
LH*RS: a highly available distributed data storage

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.