Sciweavers

6650 search results - page 130 / 1330
» Mutating database queries
Sort
View
EDBT
2009
ACM
132views Database» more  EDBT 2009»
15 years 10 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 3 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
150
Voted
ICDT
2003
ACM
202views Database» more  ICDT 2003»
15 years 8 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
140
Voted
WEBDB
1998
Springer
106views Database» more  WEBDB 1998»
15 years 7 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
DEXA
1999
Springer
181views Database» more  DEXA 1999»
15 years 7 months ago
Combining Pat-Trees and Signature Files for Query Evaluation in Document Databases
In this paper, a new indexing technique to support the query evaluation in document databases is proposed. The key idea of the method is the combination of the technique of pat-tre...
Yangjun Chen, Karl Aberer