Sciweavers

243 search results - page 15 / 49
» Evaluating structural summaries as access methods for XML
Sort
View
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...
IS
2006
13 years 8 months ago
Answering content and structure-based queries on XML documents using relevance propagation
As XML documents contain both content and structure information, taking advantage of the document structure in the retrieval process can lead to better identify relevant informati...
Karen Sauvagnat, Mohand Boughanem, Claude Chrismen...
PVLDB
2010
120views more  PVLDB 2010»
13 years 6 months ago
EXTRUCT: Using Deep Structural Information in XML Keyword Search
Users who are unfamiliar with database query languages can search XML data sets using keyword queries. Previous work has shown that current XML keyword search methods, although in...
Arash Termehchy, Marianne Winslett
SIGMOD
2004
ACM
198views Database» more  SIGMOD 2004»
14 years 8 months ago
Secure XML Querying with Security Views
The prevalent use of XML highlights the need for a generic, flexible access-control mechanism for XML documents that supports efficient and secure query access, without revealing ...
Wenfei Fan, Chee Yong Chan, Minos N. Garofalakis
EDBT
2002
ACM
129views Database» more  EDBT 2002»
14 years 8 months ago
Schema-Driven Evaluation of Approximate Tree-Pattern Queries
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
Torsten Schlieder