Sciweavers

341 search results - page 15 / 69
» Paired bondage in trees
Sort
View
184
Voted
ICDE
2003
IEEE
120views Database» more  ICDE 2003»
15 years 11 months ago
PBiTree Coding and Efficient Processing of Containment Joins
This paper addresses issues related to containment join processing in tree-structured data such as XML documents. A containment join takes two sets of XML node elements as input a...
Wei Wang 0011, Haifeng Jiang, Hongjun Lu, Jeffrey ...
86
Voted
SEMWEB
2010
Springer
14 years 7 months ago
Using Reformulation Trees to Optimize Queries over Distributed Heterogeneous Sources
Abstract. In order to effectively and quickly answer queries in environments with distributed RDF/OWL, we present a query optimization algorithm to identify the potentially relevan...
Yingjie Li, Jeff Heflin
ISPD
2006
ACM
108views Hardware» more  ISPD 2006»
15 years 3 months ago
Statistical clock tree routing for robustness to process variations
Advances in VLSI technology make clock skew more susceptible to process variations. Notwithstanding efficient zero skew routing algorithms, clock skew still limits post-manufactu...
Uday Padmanabhan, Janet Meiling Wang, Jiang Hu
SEMWEB
2007
Springer
15 years 3 months ago
Learning Subsumption Relations with CSR: a Classification based Method for the Alignment of Ontologies
In this paper we propose the "Classification-Based Learning of Subsumption Relations for the Alignment of Ontologies" (CSR) method. Given a pair of concepts from two onto...
Vassilis Spiliopoulos, Alexandros G. Valarakos, Ge...
SIGMOD
2009
ACM
140views Database» more  SIGMOD 2009»
15 years 4 months ago
Robust web extraction: an approach based on a probabilistic tree-edit model
On script-generated web sites, many documents share common HTML tree structure, allowing wrappers to effectively extract information of interest. Of course, the scripts and thus ...
Nilesh N. Dalvi, Philip Bohannon, Fei Sha