80 search results - page 12 / 16 » Efficient evaluation of generalized path pattern queries on ... |
WWW
2007
ACM
15 years 10 months ago
2007
ACM
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
EDBT
2010
ACM
15 years 25 days ago
2010
ACM
A key advantage of scientific workflow systems over traditional scripting approaches is their ability to automatically record data and process dependencies introduced during workf...
161
Voted
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
To address the needs of data intensive XML applications, a number of efficient tree pattern algorithms have been proposed. Still, most XQuery compilers do not support those algori...
77
Voted
KDD
1998
ACM
15 years 1 months ago
1998
ACM
This paper presents an algorithm for discovering conjunction rules with high reliability from data sets. The discovery of conjunction rules, each of which is a restricted form of ...
164
click to vote
ICDE
2003
IEEE
15 years 11 months ago
2003
IEEE
Structural join operations are central to evaluating queries against XML data, and are typically responsible for consuming a lion's share of the query processing time. Thus, ...