Sciweavers

817 search results - page 40 / 164
» Generating Efficient Plans for Queries Using Views
Sort
View
VLDB
2007
ACM
159views Database» more  VLDB 2007»
14 years 8 months ago
Example-driven design of efficient record matching queries
Record matching is the task of identifying records that match the same real world entity. This is a problem of great significance for a variety of business intelligence applicatio...
Surajit Chaudhuri, Bee-Chung Chen, Venkatesh Ganti...
VLDB
2004
ACM
123views Database» more  VLDB 2004»
14 years 1 months ago
CORDS: Automatic Generation of Correlation Statistics in DB2
When query optimizers erroneously assume that database columns are statistically independent, they can underestimate the selectivities of conjunctive predicates by orders of magni...
Ihab F. Ilyas, Volker Markl, Peter J. Haas, Paul G...
AAAI
2004
13 years 9 months ago
Comparing Cognitive and Computational Models of Narrative Structure
A growing number of applications seek to incorporate automatically generated narrative structure into interactive virtual environments. In this paper, we evaluate a representation...
David B. Christian, R. Michael Young
AIPS
2006
13 years 9 months ago
Durative Planning in HTNs
This paper provides techniques for hierarchical task network (HTN) planning with durative actions. HTNs can provide useful heuristic guidance to planners, express goals that canno...
Robert P. Goldman
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
14 years 7 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li