Sciweavers

3368 search results - page 81 / 674
» The Complexity of Query Reliability
Sort
View
EDBT
2004
ACM
155views Database» more  EDBT 2004»
14 years 9 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher
DASFAA
1999
IEEE
79views Database» more  DASFAA 1999»
14 years 1 months ago
Early Separation of Filter and Refinement Steps in Spatial Query Optimization
The spatial query has been processed in two steps, the filter step and the refinement step, due to a large volume and high complexity of the spatial data. However, this approach h...
Ho-Hyun Park, Chan-Gun Lee, Yong-Ju Lee, Chin-Wan ...
VLDB
1989
ACM
114views Database» more  VLDB 1989»
14 years 28 days ago
Extending the Relational Algebra to Capture Complex Objects
An important direction in database research for non-standard applications (e.g. engineering or design applications) deals with adequate support for complex objects. Without doubt,...
Bernhard Mitschang
GIS
1995
ACM
14 years 13 days ago
Measuring the Complexity of Polygonal Objects
Polygonal objects are characterized by the following well-known parameters: number of vertices, area, perimeter and so on. These parameters describe the data sets that are used in...
Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneid...
CORR
2006
Springer
186views Education» more  CORR 2006»
13 years 9 months ago
SASE: Complex Event Processing over Streams
RFID technology is gaining adoption on an increasing scale for tracking and monitoring purposes. Wide deployments of RFID devices will soon generate an unprecedented volume of dat...
Daniel Gyllstrom, Eugene Wu 0002, Hee-Jin Chae, Ya...