Sciweavers

132 search results - page 9 / 27
» Preference query evaluation over expensive attributes
Sort
View
SIGMOD
2005
ACM
146views Database» more  SIGMOD 2005»
14 years 7 months ago
Predicate Result Range Caching for Continuous Queries
Many analysis and monitoring applications require the repeated execution of expensive modeling functions over streams of rapidly changing data. These applications can often be exp...
Matthew Denny, Michael J. Franklin
SIGMOD
2009
ACM
133views Database» more  SIGMOD 2009»
14 years 7 months ago
Hierarchical result views for keyword queries over relational databases
Enabling keyword queries over relational databases (KQDB) benefits a large population of users who have difficulty in understanding the database schema or using SQLs. However, sin...
Shiyuan Wang, Jun'ichi Tatemura, Arsany Sawires, O...
DLOG
2011
12 years 11 months ago
Reasoning in Resource-Constrained Environments: a Matchmaking Engine over Relational Knowledge Bases
We present a framework for logic-based matchmaking on ALN ABoxes stored in a relational database. The proposed approach allows both non-standard reasoning and subsumption check be ...
Eufemia Tinelli, Francesco M. Donini, Michele Ruta...
IUI
2010
ACM
14 years 4 months ago
An adaptive calendar assistant using pattern mining for user preference modelling
In this paper, we present SmartCal, a calendar assistant that suggests appointment attributes, such as time, day, duration, etc., given any combination of initial user input attri...
Alfred Krzywicki, Wayne Wobcke, Anna Wong
ICDE
2007
IEEE
119views Database» more  ICDE 2007»
14 years 1 months ago
Practical Preference Relations for Large Data Sets
User-defined preferences allow personalized ranking of query results. A user provides a declarative specification of his/her preferences, and the system is expected to use that ...
Kenneth A. Ross, Peter J. Stuckey, Amélie M...