Sciweavers

1007 search results - page 17 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
TKDE
2010
200views more  TKDE 2010»
14 years 10 months ago
Incremental and General Evaluation of Reverse Nearest Neighbors
This paper presents a novel algorithm for Incremental and General Evaluation of continuous Reverse Nearest neighbor queries (IGERN, for short). The IGERN algorithm is general in t...
James M. Kang, Mohamed F. Mokbel, Shashi Shekhar, ...
ICDE
2006
IEEE
206views Database» more  ICDE 2006»
16 years 1 months ago
Query Co-Processing on Commodity Hardware
The rapid increase in the data volumes for the past few decades has intensified the need for high processing power for database and data mining applications. Researchers have acti...
Anastassia Ailamaki, Naga K. Govindaraju, Dinesh M...
85
Voted
CORR
2009
Springer
114views Education» more  CORR 2009»
14 years 9 months ago
Distributed Branching Bisimulation Minimization by Inductive Signatures
We present a new distributed algorithm for state space minimization modulo branching bisimulation. Like its predecessor it uses signatures for refinement, but the refinement proce...
Stefan Blom, Jaco van de Pol
PARLE
1993
15 years 3 months ago
Arithmetic for Parallel Linear Recursive Query Evaluation in Deductive Databases
: An arithmetic approach, such as the Level-Finding method described in this paper for evaluating linear recursive queries in deductive database systems provides great potential fo...
Jerome Robinson, Shutian Lin
ICPP
2003
IEEE
15 years 5 months ago
Towards Real-time Parallel Processing of Spatial Queries
Spatial databases are entering an era of mass deployment in various real-life applications, especially mobile and location-based services. The real-time processing of spatial quer...
Haibo Hu, Manli Zhu, Dik Lun Lee