Sciweavers

151 search results - page 15 / 31
» Answering approximate queries over autonomous web databases
Sort
View
SSD
2007
Springer
243views Database» more  SSD 2007»
14 years 1 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
SIGMOD
2005
ACM
107views Database» more  SIGMOD 2005»
14 years 7 months ago
Relational Confidence Bounds Are Easy With The Bootstrap
Statistical estimation and approximate query processing have become increasingly prevalent applications for database systems. However, approximation is usually of little use witho...
Abhijit Pol, Chris Jermaine
ESWS
2010
Springer
13 years 11 months ago
TrOWL: Tractable OWL 2 Reasoning Infrastructure
The Semantic Web movement has led to the publication of thousands of ontologies online. These ontologies present and mediate information and knowledge on the Semantic Web. Tools ex...
Edward Thomas, Jeff Z. Pan, Yuan Ren
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
14 years 9 months ago
Querying Data under Access Limitations
Data sources on the web are often accessible through web interfaces that present them as relational tables, but require certain attributes to be mandatorily selected, e.g., via a w...
Andrea Calì, Davide Martinenghi
EDBTW
2004
Springer
14 years 1 months ago
Semantic Query Routing and Processing in P2P Database Systems: The ICS-FORTH SQPeer Middleware
Abstract. Peer-to-peer (P2P) computing is currently attracting enormous attention. In P2P systems a very large number of autonomous computing nodes (the peers) pool together their ...
Giorgos Kokkinidis, Vassilis Christophides