Sciweavers

315 search results - page 27 / 63
» An Overview of Query Optimization in Relational Systems
Sort
View
ICDE
2006
IEEE
178views Database» more  ICDE 2006»
14 years 10 months ago
Declarative Querying for Biological Sequences
The ongoing revolution in life sciences research is producing vast amounts of genetic and proteomic sequence data. Scientists want to pose increasingly complex queries on this dat...
Sandeep Tata, Jignesh M. Patel, James S. Friedman,...
ICDE
2007
IEEE
174views Database» more  ICDE 2007»
14 years 3 months ago
Adapting Partitioned Continuous Query Processing in Distributed Systems
Partitioned query processing is an effective method to process continuous queries with large stateful operators in a distributed systems. This method typically partitions input da...
Yali Zhu, Elke A. Rundensteiner
SSDBM
2003
IEEE
136views Database» more  SSDBM 2003»
14 years 1 months ago
Acceleration of Relational Index Structures Based on Statistics
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
ICDE
2002
IEEE
104views Database» more  ICDE 2002»
14 years 10 months ago
Efficient Evaluation of Queries with Mining Predicates
Modern relational database systems are beginning to support ad hoc queries on mining models. In this paper, we explore novel techniques for optimizing queries that apply mining mo...
Surajit Chaudhuri, Vivek R. Narasayya, Sunita Sara...
FLAIRS
2004
13 years 10 months ago
Structure Discovery from Sequential Data
In this paper we describe I-Subdue, an extension to the Subdue graph-based data mining system. I-Subdue operates over sequentially received relational data to incrementally discov...
Jeffrey Coble, Diane J. Cook, Lawrence B. Holder, ...