Sciweavers

491 search results - page 20 / 99
» Optimizing complex queries with multiple relation instances
Sort
View
DASFAA
2004
IEEE
169views Database» more  DASFAA 2004»
15 years 3 months ago
Statistic Driven Acceleration of Object-Relational Space-Partitioning Index Structures
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
SIGMOD
2006
ACM
232views Database» more  SIGMOD 2006»
15 years 12 months ago
High-performance complex event processing over streams
In this paper, we present the design, implementation, and evaluation of a system that executes complex event queries over real-time streams of RFID readings encoded as events. The...
Eugene Wu 0002, Yanlei Diao, Shariq Rizvi
CORR
1999
Springer
116views Education» more  CORR 1999»
14 years 11 months ago
Efficient and Extensible Algorithms for Multi Query Optimization
Complex queries are becoming commonplace, with the growing use of decision support systems. These complex queries often have a lot of common sub-expressions, either within a singl...
Prasan Roy, S. Seshadri, S. Sudarshan, Siddhesh Bh...
ICDE
1995
IEEE
139views Database» more  ICDE 1995»
16 years 1 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
ICSE
2005
IEEE-ACM
15 years 12 months ago
Testing database transactions with AGENDA
AGENDA is a tool set for testing relational database applications. An earlier prototype was targeted to applications consisting of a single query and included components for popul...
Yuetang Deng, Phyllis G. Frankl, David Chays