Sciweavers

1160 search results - page 15 / 232
» Query Processing and Optimization for Pictorial Query Trees
Sort
View
ISMIS
2000
Springer
14 years 2 months ago
Top-Down Query Processing in First Order Deductive Databases under the DWFS
A top-down query processing method for first order deductive databases under the disjunctive well-founded semantics (DWFS) is presented. The method is based upon a characterisation...
C. A. Johnson
KDD
1997
ACM
131views Data Mining» more  KDD 1997»
14 years 3 months ago
Discovery of Actionable Patterns in Databases: The Action Hierarchy Approach
An approach to defining actionability as a measure of interestingness of patterns is proposed. This approach is based on the concept of an action hierarchy which is defined as a t...
Gediminas Adomavicius, Alexander Tuzhilin
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
14 years 3 months ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
EACL
2003
ACL Anthology
14 years 9 days ago
Finite Structure Query: A Tool for Querying Syntactically Annotated Corpora
Finite structure query (fsq for short) is a tool for querying syntactically annotated corpora. fsq employs a query language of high expressive power, namely full first order logi...
Stephan Kepser
SIGMOD
2003
ACM
172views Database» more  SIGMOD 2003»
14 years 11 months ago
Dynamic Sample Selection for Approximate Query Processing
In decision support applications, the ability to provide fast approximate answers to aggregation queries is desirable. One commonly-used technique for approximate query answering ...
Brian Babcock, Surajit Chaudhuri, Gautam Das