Sciweavers

116 search results - page 8 / 24
» Measuring the Complexity of Join Enumeration in Query Optimi...
Sort
View
ADBIS
2007
Springer
171views Database» more  ADBIS 2007»
15 years 3 months ago
Quete: Ontology-Based Query System for Distributed Sources
The exponential growth of the web and the extended use of database management systems in widely distributed information systems has brought to the fore the need for seamless interc...
Haridimos Kondylakis, Anastasia Analyti, Dimitris ...
SSDBM
2007
IEEE
121views Database» more  SSDBM 2007»
15 years 3 months ago
Cost-based Optimization of Complex Scientific Queries
High energy physics scientists analyze large amounts of data looking for interesting events when particles collide. These analyses are easily expressed using complex queries that ...
Ruslan Fomkin, Tore Risch
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
15 years 9 months ago
ZStream: a cost-based query processor for adaptively detecting composite events
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
Yuan Mei, Samuel Madden
CIKM
2006
Springer
15 years 1 months ago
Cache-oblivious nested-loop joins
We propose to adapt the newly emerged cache-oblivious model to relational query processing. Our goal is to automatically achieve an overall performance comparable to that of fine-...
Bingsheng He, Qiong Luo
PVLDB
2008
100views more  PVLDB 2008»
14 years 9 months ago
Efficiently approximating query optimizer plan diagrams
Given a parametrized n-dimensional SQL query template and a choice of query optimizer, a plan diagram is a color-coded pictorial enumeration of the execution plan choices of the o...
Atreyee Dey, Sourjya Bhaumik, Harish D., Jayant R....