Sciweavers

7576 search results - page 221 / 1516
» On Querying Ontologies and Databases
Sort
View
ICALP
2007
Springer
16 years 24 days ago
Constant-Round Private Database Queries
We consider several private database query problems. The starting point of this work is the element rank problem: the server holds a database of n integers, and the user an integer...
Nenad Dedic, Payman Mohassel
EDBT
2009
ACM
132views Database» more  EDBT 2009»
16 years 1 months ago
A novel approach for efficient supergraph query processing on graph databases
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
Shuo Zhang, Jianzhong Li, Hong Gao, Zhaonian Zou
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 6 months ago
Semantics and Evaluation of Top-k Queries in Probabilistic Databases
Abstract. We study here fundamental issues involved in top-k query evaluation in probabilistic databases. We consider simple probabilistic databases in which probabilities are asso...
Xi Zhang, Jan Chomicki
ICDT
2003
ACM
202views Database» more  ICDT 2003»
15 years 12 months ago
Condensed Representation of Database Repairs for Consistent Query Answering
Abstract. Repairing a database means bringing the database in accordance with a given set of integrity constraints by applying modifications that are as small as possible. In the ...
Jef Wijsen
WEBDB
1998
Springer
106views Database» more  WEBDB 1998»
15 years 11 months ago
Interactive Query and Search in Semistructured Databases
Semistructured graph-based databases have been proposed as well-suited stores for World-Wide Web data. Yet so far, languages for querying such data are too complex for casual Web ...
Roy Goldman, Jennifer Widom