Sciweavers

251 search results - page 12 / 51
» Optimizing recursive queries in SQL
Sort
View
SIGMOD
2001
ACM
229views Database» more  SIGMOD 2001»
14 years 7 months ago
A Robust, Optimization-Based Approach for Approximate Answering of Aggregate Queries
The ability to approximately answer aggregation queries accurately and efficiently is of great benefit for decision support and data mining tools. In contrast to previous sampling...
Surajit Chaudhuri, Gautam Das, Vivek R. Narasayya
IDEAS
2002
IEEE
135views Database» more  IDEAS 2002»
14 years 13 days ago
On Implicate Discovery and Query Optimization
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
Kristofer Vorwerk, G. N. Paulley
ICDE
2010
IEEE
224views Database» more  ICDE 2010»
14 years 7 months ago
Probabilistic Declarative Information Extraction
Abstract-Unstructured text represents a large fraction of the world's data. It often contain snippets of structured information within them (e.g., people's names and zip ...
Daisy Zhe Wang, Eirinaios Michelakis, Joseph M. He...
DEXAW
2007
IEEE
141views Database» more  DEXAW 2007»
14 years 1 months ago
SWARD: Semantic Web Abridged Relational Databases
The semantic web represents meta-data as a relation of triples using the RDF data model. We have developed a virtual repository system that enables to process queries to RDF views...
Johan Petrini, Tore Risch
CINQ
2004
Springer
163views Database» more  CINQ 2004»
14 years 27 days ago
Frequent Itemset Discovery with SQL Using Universal Quantification
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
Ralf Rantzau