Sciweavers

2859 search results - page 124 / 572
» Querying Complex Structured Databases
Sort
View
ICDE
2003
IEEE
155views Database» more  ICDE 2003»
14 years 9 months ago
XR-Tree: Indexing XML Data for Efficient Structural Joins
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating st...
Haifeng Jiang, Hongjun Lu, Wei Wang 0011, Beng Chi...
SIGMOD
2010
ACM
182views Database» more  SIGMOD 2010»
14 years 1 months ago
Query portals: dynamically generating portals for entity-oriented web queries
Many web queries seek information about named entities (such as products or people). Web search engines federate such entity-oriented queries to relevant structured databases; the...
Sanjay Agrawal, Kaushik Chakrabarti, Surajit Chaud...
VLDB
2006
ACM
147views Database» more  VLDB 2006»
14 years 8 months ago
Answering queries using materialized views with minimum size
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...
Rada Chirkova, Chen Li, Jia Li
ICDT
2007
ACM
114views Database» more  ICDT 2007»
14 years 2 months ago
Axiomatizing the Logical Core of XPath 2.0
The first aim of this paper is to present the logical core of XPath 2.0: a logically clean, decidable fragment, which includes most navigational features of XPath 2.0 (complex co...
Balder ten Cate, Maarten Marx
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...