Sciweavers

1381 search results - page 4 / 277
» Structural signatures for tree data structures
Sort
View
DEXAW
2006
IEEE
140views Database» more  DEXAW 2006»
14 years 1 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
SIGCSE
2005
ACM
217views Education» more  SIGCSE 2005»
14 years 1 months ago
Alternatives to two classic data structures
Red-black trees and leftist heaps are classic data structures that are commonly taught in Data Structures (CS2) and/or Algorithms (CS7) courses. This paper describes alternatives ...
Chris Okasaki
CIKM
2009
Springer
14 years 2 months ago
AS-index: a structure for string search using n-grams and algebraic signatures
AS-Index is a new index structure for exact string search in disk resident databases. It uses hashing, unlike known alternate structures, tree or trie based, and indexes every n-g...
Cédric du Mouza, Witold Litwin, Philippe Ri...
CPM
2006
Springer
125views Combinatorics» more  CPM 2006»
13 years 11 months ago
Geometric Suffix Tree: A New Index Structure for Protein 3-D Structures
Abstract. Protein structure analysis is one of the most important research issues in the post-genomic era, and faster and more accurate query data structures for such 3-D structure...
Tetsuo Shibuya
ITICSE
2009
ACM
14 years 2 months ago
Hybrid and custom data structures: evolution of the data structures course
The topic of data structures has historically been taught with two major focuses: first, the basic definition and implementation of a small set of basic data structures (e.g. list...
Daniel J. Ernst, Daniel E. Stevenson, Paul J. Wagn...