232 search results - page 8 / 47 » Or-Parallelism within Tabling |
GEOS
2005
Springer
14 years 1 months ago
2005
Springer
Continuously moving objects are prevalent in many domains. Although there have been attempts to combine both spatial and temporal relationships from a reasoning, a database, as wel...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract—Network applications often require large data storage resources, fast queries, and frequent updates. Hash tables support these operations with low costs, yet they cannot...
JBI
2002
13 years 7 months ago
2002
Document search is generally based on individual terms in the document. However, for collections within limited domains it is possible to provide more powerful access tools. This ...
ICDE
2012
IEEE
11 years 10 months ago
2012
IEEE
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
SIGMOD
2005
ACM
14 years 1 months ago
2005
ACM
Appropriately selected materialized views (also called indexed views) can speed up query execution by orders of magnitude. Most database systems limit support for materialized vie...