Sciweavers

493 search results - page 70 / 99
» Consensus answers for queries over probabilistic databases
Sort
View
VLDB
2001
ACM
138views Database» more  VLDB 2001»
15 years 10 months ago
A Data Warehousing Architecture for Enabling Service Provisioning Process
In this paper we focus on the following problem in information management: given a large collection of recorded information and some knowledge of the process that is generating th...
Yannis Kotidis
AAAI
2006
15 years 7 months ago
An Investigation into the Feasibility of the Semantic Web
This report is an expanded version of a paper in AAAI-2006 proceedings. In this report, we investigate the challenges that must be addressed for the Semantic Web to become a feasi...
Zhengxiang Pan, Abir Qasem, Jeff Heflin
SIGMOD
2007
ACM
146views Database» more  SIGMOD 2007»
16 years 6 months ago
Distributed query evaluation with performance guarantees
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
Gao Cong, Wenfei Fan, Anastasios Kementsietsidis
SIGMOD
2004
ACM
161views Database» more  SIGMOD 2004»
16 years 6 months ago
Approximation Techniques for Spatial Data
Spatial Database Management Systems (SDBMS), e.g., Geographical Information Systems, that manage spatial objects such as points, lines, and hyper-rectangles, often have very high ...
Abhinandan Das, Johannes Gehrke, Mirek Riedewald
PODS
1998
ACM
152views Database» more  PODS 1998»
15 years 10 months ago
A Cost Model for Similarity Queries in Metric Spaces
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
Paolo Ciaccia, Marco Patella, Pavel Zezula