Sciweavers

3055 search results - page 285 / 611
» Randomized Search Trees
Sort
View
232
Voted
VLDB
2005
ACM
397views Database» more  VLDB 2005»
16 years 3 months ago
Concurrency control and recovery for balanced B-link trees
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soinin...
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
16 years 23 days ago
Compact Ancestry Labeling Schemes for XML Trees
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
Fraigniaud Pierre, Korman Amos
110
Voted
AINA
2010
IEEE
15 years 8 months ago
Grid of Segment Trees for Packet Classification
—Packet classification problem has received much attention and continued to be an important topic in recent years. In packet classification problem, each incoming packet should b...
Yeim-Kuan Chang, Yung-Chieh Lin, Chen-Yu Lin
IDEAL
2009
Springer
15 years 8 months ago
Web Feed Clustering and Tagging Aggregator Using Topological Tree-Based Self-Organizing Maps
With the rapid and dramatic increase in web feeds published by different publishers, providers or websites via Really Simple Syndication (RSS) and Atom, users cannot be expected t...
Richard T. Freeman
ACMSE
2006
ACM
15 years 5 months ago
Phoenix-based clone detection using suffix trees
A code clone represents a sequence of statements that are duplicated in multiple locations of a program. Clones often arise in source code as a result of multiple cut/paste operat...
Robert Tairas, Jeff Gray