1331 search results - page 228 / 267 » Complexity bounds for zero-test algorithms |
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
This paper addresses the problem of efficient maintenance of a materialized skyline view in response to skyline removals. While there has been significant progress on skyline quer...
PODS
2006
ACM
14 years 7 months ago
2006
ACM
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
ISAAC
2003
Springer
14 years 27 days ago
2003
Springer
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
COMPGEOM
2010
ACM
14 years 24 days ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
COMPGEOM
2010
ACM
14 years 24 days ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...