6 search results - page 1 / 2 » Efficient Enumeration for Conjunctive Queries over X-underba... |
CSL
2010
Springer
13 years 6 months ago
2010
Springer
PVLDB
2008
13 years 4 months ago
2008
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
SIGMOD
2008
ACM
14 years 5 months ago
2008
ACM
We study the problem of querying relational data embedded in XML. Relational data can be represented by various tree structures in XML. However, current XML query methods, such as...
SIGMOD
2004
ACM
14 years 5 months ago
2004
ACM
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 ...
SIGMOD
2004
ACM
14 years 5 months ago
2004
ACM
The rich dependency structure found in the columns of real-world relational databases can be exploited to great advantage, but can also cause query optimizers--which usually assum...