Sciweavers

128 search results - page 3 / 26
» Efficient Evaluation of Multiple Preference Queries
Sort
View
ATAL
2004
Springer
14 years 23 days ago
Automated Multi-Attribute Negotiation with Efficient Use of Incomplete Preference Information
This paper presents a model for integrative, one-to-one negotiation in which the values across multiple attributes are negotiated simultaneously. We model a mechanism in which age...
Catholijn M. Jonker, Valentin Robu
IDEAS
2005
IEEE
109views Database» more  IDEAS 2005»
14 years 29 days ago
Efficient Relational Joins with Arithmetic Constraints on Multiple Attributes
We introduce and study a new class of queries that we refer to as ACMA (arithmetic constraints on multiple attributes) queries. Such combinatorial queries require the simultaneous...
Chuang Liu, Lingyun Yang, Ian T. Foster
DASFAA
2007
IEEE
134views Database» more  DASFAA 2007»
14 years 1 months ago
Eliciting Matters - Controlling Skyline Sizes by Incremental Integration of User Preferences
Today, result sets of skyline queries are unmanageable due to their exponential growth with the number of query predicates. In this paper we discuss the incremental re-computation ...
Wolf-Tilo Balke, Ulrich Güntzer, Christoph Lo...
EDBT
2010
ACM
177views Database» more  EDBT 2010»
13 years 9 months ago
PerK: personalized keyword search in relational databases through preferences
Keyword-based search in relational databases allows users to discover relevant information without knowing the database schema or using complicated queries. However, such searches...
Kostas Stefanidis, Marina Drosou, Evaggelia Pitour...
KDD
2002
ACM
150views Data Mining» more  KDD 2002»
14 years 7 months ago
Querying multiple sets of discovered rules
Rule mining is an important data mining task that has been applied to numerous real-world applications. Often a rule mining system generates a large number of rules and only a sma...
Alexander Tuzhilin, Bing Liu