Sciweavers

706 search results - page 75 / 142
» An Integer Linear Programming Approach to Database Design
Sort
View
VLDB
1995
ACM
96views Database» more  VLDB 1995»
15 years 2 months ago
The Fittest Survives: An Adaptive Approach to Query Optimization
Traditionally, optimizers are “programmed” to optimize queries following a set of buildin procedures. However, optimizers should be robust to its changing environment to gener...
Hongjun Lu, Kian-Lee Tan, Son Dao
JAIR
2006
122views more  JAIR 2006»
14 years 11 months ago
Solving Factored MDPs with Hybrid State and Action Variables
Efficient representations and solutions for large decision problems with continuous and discrete variables are among the most important challenges faced by the designers of automa...
Branislav Kveton, Milos Hauskrecht, Carlos Guestri...
ASP
2003
Springer
15 years 4 months ago
Mappings Between Domain Models in Answer Set Programming
Integration of data is required when accessing multiple databases within an organization or on the WWW. Schema integration is required for database interoperability, but it is curr...
Stefania Costantini, Andrea Formisano, Eugenio G. ...
PODS
1995
ACM
139views Database» more  PODS 1995»
15 years 2 months ago
Normalizing Incomplete Databases
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...
Leonid Libkin
DATESO
2009
101views Database» more  DATESO 2009»
14 years 9 months ago
Using Top Trees For Easy Programming of Tree Algorithms
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
Michal Vajbar