Sciweavers

2514 search results - page 121 / 503
» On the Computation of Approximations of Database Queries
Sort
View
PODS
2003
ACM
113views Database» more  PODS 2003»
16 years 6 months ago
Materializing views with minimal size to answer queries
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
Rada Chirkova, Chen Li
DBSEC
2007
104views Database» more  DBSEC 2007»
15 years 7 months ago
New Paradigm of Inference Control with Trusted Computing
Abstract. The database server is a crucial bottleneck in traditional inference control architecture, as it enforces highly computation-intensive auditing for all users who query th...
Yanjiang Yang, Yingjiu Li, Robert H. Deng
ICDE
2010
IEEE
568views Database» more  ICDE 2010»
16 years 6 months ago
Reverse Top-k Queries
Rank-aware query processing has become essential for many applications that return to the user only the top-k objects based on the individual user's preferences. Top-k queries...
Akrivi Vlachou, Christos Doulkeridis, Kjetil N&osl...
PAKDD
2004
ACM
94views Data Mining» more  PAKDD 2004»
15 years 11 months ago
Towards Optimizing Conjunctive Inductive Queries
Inductive queries are queries to an inductive database that generate a set of patterns in a data mining context. Inductive querying poses new challenges to database and data mining...
Johannes Fischer, Luc De Raedt
SAC
2006
ACM
16 years 11 days ago
Ontology-based integration for relational databases
In this paper, we show that representation and reasoning techniques used in traditional knowledge engineering and the emerging Semantic Web can play an important role for heteroge...
Dejing Dou, Paea LePendu