Sciweavers

1381 search results - page 72 / 277
» Structural signatures for tree data structures
Sort
View
CPM
1999
Springer
144views Combinatorics» more  CPM 1999»
15 years 2 months ago
Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
Strahil Ristov, Eric Laporte
ICMCS
2006
IEEE
135views Multimedia» more  ICMCS 2006»
15 years 3 months ago
Degree Pre-Reserved Hierarchical Tree for Multimedia Multicast
Overlay multicast tree is widely used to support large-scale real-time multimedia applications. The scalability and the robustness are two key issues in the overlay structure desi...
Nan Zhang, Yuanchun Shi, Bin Chang
SIGMOD
1997
ACM
146views Database» more  SIGMOD 1997»
15 years 2 months ago
Concurrency and Recovery in Generalized Search Trees
This paper presents general algorithms for concurrency control in tree-based access methods as well as a recovery protocol and a mechanism for ensuring repeatable read. The algori...
Marcel Kornacker, C. Mohan, Joseph M. Hellerstein
OPODIS
2004
14 years 11 months ago
Self-tuning Reactive Distributed Trees for Counting and Balancing
The main contribution of this paper is that it shows that it is possible to have reactive distributed trees for counting and balancing with no need for the user to fix manually any...
Phuong Hoai Ha, Marina Papatriantafilou, Philippas...
UAI
1996
14 years 11 months ago
Binary Join Trees
The main goal of this paper is to describe a data structure called binary join trees that are useful in computing multiple marginals efficiently using the Shenoy-Shafer architectu...
Prakash P. Shenoy