Sciweavers

708 search results - page 38 / 142
» A Genetic Algorithm for Database Query Optimization
Sort
View
FOIKS
2004
Springer
14 years 2 months ago
Query Answering and Containment for Regular Path Queries under Distortions
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
Gösta Grahne, Alex Thomo
IADIS
2008
13 years 10 months ago
Information Retrieval with Cluster Genetic
This article presents an online cluster using genetic algorithms to increase information retrieval efficiency. The Information Retrieval (IR) is based on the grouping of documents...
José Luis Castillo Sequera, José Ra&...
SIGMOD
2001
ACM
147views Database» more  SIGMOD 2001»
14 years 9 months ago
Optimizing Queries Using Materialized Views: A practical, scalable solution
Materialized views can provide massive improvements in query processing time, especially for aggregation queries over large tables. To realize this potential, the query optimizer ...
Jonathan Goldstein, Per-Åke Larson
SIGMOD
2007
ACM
121views Database» more  SIGMOD 2007»
14 years 9 months ago
EaseDB: a cache-oblivious in-memory query processor
We propose to demonstrate EaseDB, the first cache-oblivious query processor for in-memory relational query processing. The cacheoblivious notion from the theory community refers t...
Bingsheng He, Yinan Li, Qiong Luo, Dongqing Yang
PODS
2003
ACM
113views Database» more  PODS 2003»
14 years 9 months ago
Materializing views with minimal size to answer queries
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
Rada Chirkova, Chen Li