Sciweavers

514 search results - page 84 / 103
» Answer Sets for Consistent Query Answering in Inconsistent D...
Sort
View
LPNMR
2005
Springer
14 years 4 months ago
Data Integration: a Challenging ASP Application
Abstract. The paper presents INFOMIX a successful application of ASP technology to the domain of Data Integration. INFOMIX is a novel system which supports powerful information int...
Nicola Leone, Thomas Eiter, Wolfgang Faber, Michae...
FSTTCS
2004
Springer
14 years 4 months ago
Approximate Range Searching Using Binary Space Partitions
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
Mark de Berg, Micha Streppel
SSD
2007
Springer
243views Database» more  SSD 2007»
14 years 5 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...
SSDBM
1999
IEEE
140views Database» more  SSDBM 1999»
14 years 3 months ago
An Infrastructure for Scalable Parallel Multidimensional Analysis
Multidimensional Analysis in On-Line Analytical Processing (OLAP), and Scientific and statistical databases (SSDB) use operations requiring summary information on multi-dimensiona...
Sanjay Goil, Alok N. Choudhary
ICDT
2012
ACM
242views Database» more  ICDT 2012»
12 years 1 months ago
Win-move is coordination-free (sometimes)
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog¬ program and the number of “coordination stages” require...
Daniel Zinn, Todd J. Green, Bertram Ludäscher