Sciweavers

125 search results - page 10 / 25
» Inferring Query Performance Using Pre-retrieval Predictors.
Sort
View
FUIN
2010
130views more  FUIN 2010»
15 years 4 months ago
SLGAD Resolution for Inference on Logic Programs with Annotated Disjunctions
Abstract. Logic Programs with Annotated Disjunctions (LPADs) allow to express probabilistic information in logic programming. The semantics of an LPAD is given in terms of the well...
Fabrizio Riguzzi
154
Voted
SIGMOD
2004
ACM
160views Database» more  SIGMOD 2004»
16 years 6 months ago
Extending Query Rewriting Techniques for Fine-Grained Access Control
Current day database applications, with large numbers of users, require fine-grained access control mechanisms, at the level of individual tuples, not just entire relations/views,...
Shariq Rizvi, Alberto O. Mendelzon, S. Sudarshan, ...
ESWS
2009
Springer
16 years 11 days ago
Ranking Approximate Answers to Semantic Web Queries
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
180
Voted
EDBT
2010
ACM
177views Database» more  EDBT 2010»
16 years 19 days ago
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
Abhay Jha, Dan Olteanu, Dan Suciu
SIGMOD
2009
ACM
180views Database» more  SIGMOD 2009»
16 years 6 months ago
Indexing correlated probabilistic databases
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
Bhargav Kanagal, Amol Deshpande