136 search results - page 26 / 28 » Query optimizer for spatial join operations |
SIGMOD
2002
ACM
14 years 8 months ago
2002
ACM
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
SSD
2005
Springer
14 years 1 months ago
2005
Springer
Most recent research on querying and managing data streams has concentrated on traditional data models where the data come in the form of tuples or XML data. Complex types of strea...
ICDE
2010
IEEE
14 years 2 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
NATO
1993
13 years 12 months ago
1993
METU Object-Oriented DBMS 1 includes the implementation of a database kernel, an object-oriented SQL-like language and a graphical user interface. Kernel functions are divided bet...