Sciweavers

320 search results - page 1 / 64
» Algebraic Signatures for Scalable Distributed Data Structure...
Sort
View
ICDE
2004
IEEE
120views Database» more  ICDE 2004»
14 years 5 months ago
Algebraic Signatures for Scalable Distributed Data Structures
Signatures detect changes to the data objects. Numerous schemes a known, e.g., the popular hash based SHA-1 standard. We propose a nov scheme we call algebraic signatures. We use ...
Witold Litwin, Thomas J. E. Schwarz
DEXAW
2006
IEEE
140views Database» more  DEXAW 2006»
13 years 10 months ago
String-Matching and Update through Algebraic Signatures in Scalable Distributed Data Structures
: Scalable Distributed Data Structures (SDDSs) store large scalable files over a distributed RAM of nodes in a grid or a P2P network. The files scale transparently for the applicat...
Riad Mokadem, Witold Litwin
VLDB
2007
ACM
113views Database» more  VLDB 2007»
14 years 4 months ago
Fast nGram-Based String Search Over Data Encoded Using Algebraic Signatures
We propose a novel string search algorithm for data stored once and read many times. Our search method combines the sublinear traversal of the record (as in Boyer Moore or Knuth-M...
Witold Litwin, Riad Mokadem, Philippe Rigaux, Thom...
PVLDB
2010
136views more  PVLDB 2010»
13 years 2 months ago
SigMatch: Fast and Scalable Multi-Pattern Matching
Multi-pattern matching involves matching a data item against a large database of “signature” patterns. Existing algorithms for multipattern matching do not scale well as the s...
Ramakrishnan Kandhan, Nikhil Teletia, Jignesh M. P...
ISAAC
2005
Springer
129views Algorithms» more  ISAAC 2005»
13 years 9 months ago
SkipTree: A Scalable Range-Queryable Distributed Data Structure for Multidimensional Data
This paper presents the SkipTree, a new balanced, distributed data structure for storing data with multidimensional keys in a peer-topeer network. The SkipTree supports range quer...
Saeed Alaei, Mohammad Toossi, Mohammad Ghodsi