Sciweavers

716 search results - page 35 / 144
» Optimizing Queries in Extended Relational Databases
Sort
View
SIGMOD
2006
ACM
232views Database» more  SIGMOD 2006»
15 years 11 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
ICDT
2005
ACM
128views Database» more  ICDT 2005»
15 years 4 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
ICDE
2010
IEEE
201views Database» more  ICDE 2010»
14 years 11 months ago
Vertical partitioning of relational OLTP databases using integer programming
A way to optimize performance of relational row store databases is to reduce the row widths by vertically partitioning tables into table fractions in order to minimize the number ...
Rasmus Resen Amossen
SIGMOD
1997
ACM
91views Database» more  SIGMOD 1997»
15 years 3 months ago
On Saying "Enough Already!" in SQL
In this paper, we study a simple SQL extension that enables query writers to explicitly limit the cardinality of a query result. We examine its impact on the query optimization an...
Michael J. Carey, Donald Kossmann
ICDE
2003
IEEE
170views Database» more  ICDE 2003»
16 years 17 days ago
Keyword Proximity Search on XML Graphs
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
Vagelis Hristidis, Yannis Papakonstantinou, Andrey...