Sciweavers

119 search results - page 16 / 24
» Complex Preferences for Answer Set Optimization
Sort
View
DASFAA
2010
IEEE
190views Database» more  DASFAA 2010»
13 years 11 months ago
k-Selection Query over Uncertain Data
This paper studies a new query on uncertain data, called k-selection query. Given an uncertain dataset of N objects, where each object is associated with a preference score and a p...
Xingjie Liu, Mao Ye, Jianliang Xu, Yuan Tian, Wang...
SIGMOD
1996
ACM
120views Database» more  SIGMOD 1996»
14 years 7 hour ago
Implementing Data Cubes Efficiently
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data ...
Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ull...
CP
1998
Springer
14 years 3 days ago
Modelling CSP Solution Algorithms with Petri Decision Nets
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
Stephan Pontow
SODA
2010
ACM
146views Algorithms» more  SODA 2010»
14 years 5 months ago
Classified Stable Matching
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...
Chien-Chung Huang
ICDE
1999
IEEE
101views Database» more  ICDE 1999»
14 years 9 months ago
Index Merging
Indexes play a vital role in decision support systems by reducing the cost of answering complex queries. A popular methodology for choosing indexes that is adopted by database adm...
Surajit Chaudhuri, Vivek R. Narasayya