Sciweavers

27 search results - page 5 / 6
» Compact Ancestry Labeling Schemes for XML Trees
Sort
View
PODC
2003
ACM
13 years 11 months ago
Compact roundtrip routing with topology-independent node names
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
Marta Arias, Lenore Cowen, Kofi A. Laing
WCRE
2000
IEEE
13 years 10 months ago
Towards Portable Source Code Representations using XML
One of the most important issue in source code analysis and software re-engineering is the representation of ode text at an abstraction level and form suitable for algorithmic pro...
Evan Mamas, Kostas Kontogiannis
ICDE
2006
IEEE
155views Database» more  ICDE 2006»
14 years 7 months ago
Designing and Evaluating an XPath Dialect for Linguistic Queries
Linguistic research and natural language processing employ large repositories of ordered trees. XML, a standard ordered tree model, and XPath, its associated language, are natural...
Steven Bird, Yi Chen, Susan B. Davidson, Haejoong ...
ADC
2008
Springer
143views Database» more  ADC 2008»
13 years 7 months ago
TRACK : A Novel XML Join Algorithm for Efficient Processing Twig Queries
In order to find all occurrences of a tree/twig pattern in an XML database, a number of holistic twig join algorithms have been proposed. However, most of these algorithms focus o...
Dongyang Li, Chunping Li
CIKM
2006
Springer
13 years 9 months ago
TRIPS and TIDES: new algorithms for tree mining
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
Shirish Tatikonda, Srinivasan Parthasarathy, Tahsi...