736 search results - page 63 / 148 » Confidence-Aware Join Algorithms |
245
Voted
ICDE
1995
IEEE
16 years 5 months ago
1995
IEEE
We describe set-oriented algorithms for mining association rules. Such algorithms imply performing multiple joins and may appear to be inherently less escient than special-purpose...
145
Voted
JCT
2008
15 years 3 months ago
2008
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...
256
Voted
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
239
Voted
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
131
Voted
WWW
2005
ACM
16 years 4 months ago
2005
ACM
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. A number of algorithms have been proposed to process ...