Sciweavers

99 search results - page 17 / 20
» On the complexity of division and set joins in the relationa...
Sort
View
SBBD
2004
119views Database» more  SBBD 2004»
13 years 9 months ago
Computing the Dependency Basis for Nested List Attributes
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
Sven Hartmann, Sebastian Link
CVPR
2008
IEEE
14 years 10 months ago
Probabilistic graph and hypergraph matching
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
Ron Zass, Amnon Shashua
SIGMOD
2004
ACM
105views Database» more  SIGMOD 2004»
14 years 8 months ago
Query Processing for SQL Updates
A rich set of concepts and techniques has been developed in the context of query processing for the efficient and robust execution of queries. So far, this work has mostly focused...
César A. Galindo-Legaria, Stefano Stefani, ...
COMPGEOM
2006
ACM
14 years 1 months ago
The predicates for the Voronoi diagram of ellipses
This paper examines the computation of the Voronoi diagram of a set of ellipses in the Euclidean plane. We propose the first complete algorithms, under the exact computation para...
Ioannis Z. Emiris, Elias P. Tsigaridas, George M. ...
EDBTW
2006
Springer
13 years 11 months ago
A Data and Query Model for Streaming Geospatial Image Data
Abstract. Most of the recent work on adaptive processing and continuous querying of data streams assume that data objects come in the form of tuples, thus relying on the relational...
Michael Gertz, Quinn Hart, Carlos Rueda, Shefali S...