Sciweavers

365 search results - page 13 / 73
» Answering Non-Monotonic Queries in Relational Data Exchange
Sort
View
IS
2008
14 years 9 months ago
A framework for semantic grouping in P2P databases
Abstract. Sharing of structured data in decentralized environments is a challenging problem, especially in the absence of a global schema. Social network structures map network lin...
Verena Kantere, Dimitrios Tsoumakos, Timos K. Sell...
SIGMOD
1999
ACM
101views Database» more  SIGMOD 1999»
15 years 1 months ago
Join Synopses for Approximate Query Answering
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
Swarup Acharya, Phillip B. Gibbons, Viswanath Poos...
SAC
2006
ACM
15 years 3 months ago
Ontology-based integration for relational databases
In this paper, we show that representation and reasoning techniques used in traditional knowledge engineering and the emerging Semantic Web can play an important role for heteroge...
Dejing Dou, Paea LePendu
ASWC
2009
Springer
15 years 4 months ago
Querying the Web of Data: A Formal Approach
Abstract. The increasing amount of interlinked RDF data has finally made available the necessary building blocks for the web of data. This in turns makes it possible (and interest...
Paolo Bouquet, Chiara Ghidini, Luciano Serafini
SDM
2003
SIAM
129views Data Mining» more  SDM 2003»
14 years 10 months ago
Approximate Query Answering by Model Averaging
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
Dmitry Pavlov, Padhraic Smyth