Sciweavers

789 search results - page 105 / 158
» On Theory Revision with Queries
Sort
View
120
Voted
CORR
2010
Springer
201views Education» more  CORR 2010»
14 years 10 months ago
Online Advertisement, Optimization and Stochastic Networks
In this paper, we propose a stochastic model to describe how search service providers charge client companies based on users' queries for the keywords related to these compan...
R. Srikant
117
Voted
PODS
2012
ACM
253views Database» more  PODS 2012»
13 years 3 months ago
Local transformations and conjunctive-query equivalence
Over the past several decades, the study of conjunctive queries has occupied a central place in the theory and practice of database systems. In recent years, conjunctive queries h...
Ronald Fagin, Phokion G. Kolaitis
129
Voted
ICDT
2012
ACM
242views Database» more  ICDT 2012»
13 years 3 months ago
Win-move is coordination-free (sometimes)
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog¬ program and the number of “coordination stages” require...
Daniel Zinn, Todd J. Green, Bertram Ludäscher
CCS
2007
ACM
15 years 7 months ago
Managing RBAC states with transitive relations
In this paper, we study the maintenance of role-based access control (RBAC) models in database environments using transitive closure relations. In particular, the algorithms that ...
Chaoyi Pang, David P. Hansen, Anthony J. Maeder
PODS
2007
ACM
159views Database» more  PODS 2007»
16 years 26 days ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...