Sciweavers

493 search results - page 16 / 99
» Consensus answers for queries over probabilistic databases
Sort
View
VLDB
2012
ACM
361views Database» more  VLDB 2012»
12 years 2 months ago
Answering pattern match queries in large graph databases via graph embedding
The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest path query, reachability verification, and pattern ...
Lei Zou, Lei Chen 0002, M. Tamer Özsu, Dongya...
CIKM
2008
Springer
13 years 9 months ago
Aggregate queries over ontologies
Answering queries over ontologies is an important issue for the Semantic Web. Aggregate queries were widely studied for relational databases but almost no results are known for ag...
Diego Calvanese, Evgeny Kharlamov, Werner Nutt, Ca...
VLDB
1991
ACM
157views Database» more  VLDB 1991»
13 years 11 months ago
Integrating Implicit Answers with Object-Oriented Queries
Queries in object-oriented datab;Lqcs are formulated against a class and retrieve instnnccls of the class sat,isfying a certain predicate on the att,riblltes of the class. The pre...
Hava T. Siegelmann, B. R. Badrinath
ICEBE
2005
IEEE
168views Business» more  ICEBE 2005»
14 years 1 months ago
Frequency Operators for Condensative Queries over Data Streams
Over a traditional Database Management System (DBMS), the answer to an aggregate query is usually much smaller than the answer to a similar nonaggregate query. Therefore, we call ...
Lisha Ma, Werner Nutt
VLDB
1990
ACM
116views Database» more  VLDB 1990»
13 years 11 months ago
A Probabilistic Framework for Vague Queries and Imprecise Information in Databases
A probabilistic learning model for vague queries and missing or imprecise information in databases is described. Instead of retrieving only a set of answers, our approach yields a...
Norbert Fuhr