Sciweavers

205 search results - page 11 / 41
» Optimizing Multiple Top-K Queries over Joins
Sort
View
ICDE
2010
IEEE
801views Database» more  ICDE 2010»
14 years 7 months ago
The Similarity Join Database Operator
Similarity joins have been studied as key operations in multiple application domains, e.g., record linkage, data cleaning, multimedia and video applications, and phenomena detectio...
Mohamed H. Ali, Walid G. Aref, Yasin N. Silva
ICDE
1995
IEEE
139views Database» more  ICDE 1995»
14 years 9 months ago
Set-Oriented Mining for Association Rules in Relational Databases
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...
Maurice A. W. Houtsma, Arun N. Swami
CIKM
2005
Springer
14 years 1 months ago
Optimizing cursor movement in holistic twig joins
Holistic twig join algorithms represent the state of the art for evaluating path expressions in XML queries. Using inverted indexes on XML elements, holistic twig joins move a set...
Marcus Fontoura, Vanja Josifovski, Eugene J. Sheki...
SIGMOD
2002
ACM
145views Database» more  SIGMOD 2002»
14 years 7 months ago
Continuously adaptive continuous queries over streams
We present a continuously adaptive, continuous query (CACQ) implementation based on the eddy query processing framework. We show that our design provides significant performance b...
Samuel Madden, Mehul A. Shah, Joseph M. Hellerstei...
SEMWEB
2010
Springer
13 years 5 months ago
Using Reformulation Trees to Optimize Queries over Distributed Heterogeneous Sources
Abstract. In order to effectively and quickly answer queries in environments with distributed RDF/OWL, we present a query optimization algorithm to identify the potentially relevan...
Yingjie Li, Jeff Heflin