Sciweavers

1272 search results - page 75 / 255
» Structured queries in XML retrieval
Sort
View
EDBT
2008
ACM
159views Database» more  EDBT 2008»
14 years 8 months ago
Automaton in or out: run-time plan optimization for XML stream processing
Many systems such as Tukwila and YFilter combine automaton and algebra techniques to process queries over tokenized XML streams. Typically in this architecture, an automaton is fi...
Hong Su, Elke A. Rundensteiner, Murali Mani
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
14 years 9 months ago
Counting Twig Matches in a Tree
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koud...
EDBTW
2006
Springer
13 years 11 months ago
Hash-Based Structural Join Algorithms
Abstract. Algorithms for processing Structural Joins embody essential building blocks for XML query evaluation. Their design is a difficult task, because they have to satisfy many ...
Christian Mathis, Theo Härder
CIKM
2005
Springer
14 years 1 months ago
Interconnection semantics for keyword search in XML
A framework for describing semantic relationships among nodes in XML documents is presented. In contrast to earlier work, the XML documents may have ID references (i.e., they corr...
Sara Cohen, Yaron Kanza, Benny Kimelfeld, Yehoshua...
HIM
1997
Springer
162views Multimedia» more  HIM 1997»
14 years 1 days ago
Probabilistic Logical Information Retrieval for Content, Hypertext, and Database Querying
Classical retrieval models support content-oriented searching for documents using a set of words as data model. However, in hypertext and database applications we want to consider...
Thomas Rölleke, Markus Blömer