6004 search results - page 266 / 1201 » Parallelizing query optimization |
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
92
Voted
PODS
2010
ACM
15 years 5 months ago
2010
ACM
A scheme that publishes aggregate information about sensitive data must resolve the trade-off between utility to information consumers and privacy of the database participants. D...
113
click to vote
SIGMOD
2004
ACM
16 years 23 days ago
2004
ACM
Cardinality estimation during query optimization relies on simplifying assumptions that usually do not hold in practice. To diminish the impact of inaccurate estimates during opti...
101
Voted
ICDE
2010
IEEE
16 years 11 days ago
2010
IEEE
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
SSDBM
2008
IEEE
15 years 7 months ago
2008
IEEE
Applications requiring the handling of uncertain data have led to the development of database management systems extending the scope of relational databases to include uncertain (p...