Sciweavers

777 search results - page 24 / 156
» Optimization of Relational Preference Queries
Sort
View
PODS
2010
ACM
249views Database» more  PODS 2010»
14 years 22 days ago
Semantic query optimization in the presence of types
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...
Michael Meier 0002, Michael Schmidt, Fang Wei, Geo...
SIGMOD
2003
ACM
98views Database» more  SIGMOD 2003»
14 years 7 months ago
On Relational Support for XML Publishing: Beyond Sorting and Tagging
In this paper, we study whether the need for efficient XML publishing brings any new requirements for relational query engines, or if sorting query results in the relational engin...
Surajit Chaudhuri, Raghav Kaushik, Jeffrey F. Naug...
ICMCS
2006
IEEE
120views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Shape-Based Visual Query Rewriting
A visual query is based on pictorial representation of conceptual entities and operations. One of the most important features used in visual queries is the shape. Despite its intu...
Georges Chalhoub, Richard Chbeir, Kokou Yét...
ICDE
2006
IEEE
138views Database» more  ICDE 2006»
14 years 9 months ago
SUBSKY: Efficient Computation of Skylines in Subspaces
Given a set of multi-dimensional points, the skyline contains the best points according to any preference function that is monotone on all axes. In practice, applications that req...
Yufei Tao, Xiaokui Xiao, Jian Pei
ICDM
2008
IEEE
172views Data Mining» more  ICDM 2008»
14 years 2 months ago
Active Learning of Equivalence Relations by Minimizing the Expected Loss Using Constraint Inference
Selecting promising queries is the key to effective active learning. In this paper, we investigate selection techniques for the task of learning an equivalence relation where the ...
Steffen Rendle, Lars Schmidt-Thieme