Sciweavers

3368 search results - page 190 / 674
» The Complexity of Query Reliability
Sort
View
ICDE
1999
IEEE
89views Database» more  ICDE 1999»
16 years 7 months ago
Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes
Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM) over all selected cells in a data cube, where the ...
Steven Geffner, Divyakant Agrawal, Amr El Abbadi, ...
ICDT
2007
ACM
107views Database» more  ICDT 2007»
16 years 20 days ago
Some Algorithmic Improvements for the Containment Problem of Conjunctive Queries with Negation
Query containment is a fundamental problem of databases. Given two queries q1 and q2, it asks whether the set of answers to q1 is included in the set of answers to q2 for any datab...
Michel Leclère, Marie-Laure Mugnier
GLOBE
2009
Springer
15 years 11 months ago
AGiDS: A Grid-Based Strategy for Distributed Skyline Query Processing
Skyline queries help users make intelligent decisions over complex data, where different and often conflicting criteria are considered. A challenging problem is to support skylin...
João B. Rocha-Junior, Akrivi Vlachou, Chris...
FAW
2009
Springer
118views Algorithms» more  FAW 2009»
15 years 10 months ago
Space-Query-Time Tradeoff for Computing the Visibility Polygon
Abstract. Computing the visibility polygon, VP, of a point in a polygonal scene, is a classical problem that has been studied extensively. In this paper, we consider the problem of...
Mostafa Nouri, Mohammad Ghodsi
DBISP2P
2006
Springer
195views Database» more  DBISP2P 2006»
15 years 10 months ago
XML Query Routing in Structured P2P Systems
Abstract. This paper addresses the problem of data placement, indexing, and querying large XML data repositories distributed over an existing P2P service infrastructure. Our archit...
Leonidas Fegaras, Weimin He, Gautam Das, David Lev...