Sciweavers

17 search results - page 1 / 4
» Short Labels for Lowest Common Ancestors in Trees
Sort
View
ESA
2009
Springer
77views Algorithms» more  ESA 2009»
13 years 11 months ago
Short Labels for Lowest Common Ancestors in Trees
We evaluate the practical performance of labeling schemes for lowest common ancestors in trees. We develop different variants for encoding the labels. We then perform a thorough e...
Johannes Fischer
IPL
2010
71views more  IPL 2010»
13 years 3 months ago
New common ancestor problems in trees and directed acyclic graphs
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
Johannes Fischer, Daniel H. Huson
ESA
2008
Springer
119views Algorithms» more  ESA 2008»
13 years 6 months ago
Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors
Saverio Caminiti, Irene Finocchi, Rossella Petresc...
WWW
2008
ACM
14 years 5 months ago
Race: finding and ranking compact connected trees for keyword proximity search over xml documents
In this paper, we study the problem of keyword proximity search over XML documents and leverage the efficiency and effectiveness. We take the disjunctive semantics among input key...
Guoliang Li, Jianhua Feng, Jianyong Wang, Bei Yu, ...
SIGMOD
2005
ACM
161views Database» more  SIGMOD 2005»
14 years 4 months ago
Efficient Keyword Search for Smallest LCAs in XML Databases
Keyword search is a proven, user-friendly way to query HTML documents in the World Wide Web. We propose keyword search in XML documents, modeled as labeled trees, and describe cor...
Yu Xu, Yannis Papakonstantinou