Sciweavers

1018 search results - page 2 / 204
» On the minimization of XPath queries
Sort
View
VLDB
2004
ACM
96views Database» more  VLDB 2004»
13 years 10 months ago
Answering XPath Queries over Networks by Sending Minimal Views
When a client submits a set of XPath queries to a XML database on a network, the set of answer sets sent back by the database may include redundancy in two ways: some elements may...
Keishi Tajima, Yoshiki Fukui
EDBT
2008
ACM
108views Database» more  EDBT 2008»
14 years 5 months ago
Revisiting redundancy and minimization in an XPath fragment
Redundancy and minimization of queries are investigated in a well known fragment of XPath that includes child and descendant edges, branches, wildcards, and multiple output nodes....
Benny Kimelfeld, Yehoshua Sagiv
CIKM
2009
Springer
13 years 10 months ago
Minimal common container of tree patterns
Tree patterns represent important fragments of XPath. In this paper, we show that some classes of tree patterns exhibit such a property that, given a finite number of tree patter...
Junhu Wang, Jeffrey Xu Yu, Chaoyi Pang, Chengfei L...
INEX
2004
Springer
13 years 10 months ago
Narrowed Extended XPath I (NEXI)
INEX has through the years provided two types of queries: Content-Only queries (CO) and Content-And-Structure queries (CAS). The CO language has not changed much, but the CAS lang...
Andrew Trotman, Börkur Sigurbjörnsson
ICDE
2004
IEEE
120views Database» more  ICDE 2004»
14 years 6 months ago
Minimization and Group-By Detection for Nested XQueries
We describe and evaluate a query minimization technique that applies to XQueries, which are nested, perform arbitrary joins, and freely mix bag and set semantics. These features c...
Alin Deutsch, Yannis Papakonstantinou, Yu Xu