1125 search results - page 165 / 225 » Query Answering in Inconsistent Databases |
137
click to vote
MDM
2009
Springer
15 years 9 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
137
Voted
SEMCO
2008
IEEE
15 years 8 months ago
2008
IEEE
We developed a novel analytical environment to aid in the examination of the extensive amount of interconnected data available for genome projects. Our focus is to enable ity and ...
119
Voted
WIDM
2003
ACM
15 years 7 months ago
2003
ACM
Whenever XML data must be shared by heterogeneous applications, transformations between different applicationspecific XML formats are necessary. The state-of-the-art method transf...
125
click to vote
DKE
2006
15 years 2 months ago
2006
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
110
Voted
CORR
2007
Springer
15 years 2 months ago
2007
Springer
We address the problem of answering Web ontology queries efficiently. An ontology is formalized as a Deductive Ontology Base (DOB), a deductive database that comprises the ontology...