Sciweavers

1031 search results - page 177 / 207
» Managing the operator ordering problem in parallel databases
Sort
View
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
11 years 10 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
ICDE
2012
IEEE
269views Database» more  ICDE 2012»
11 years 10 months ago
A Deep Embedding of Queries into Ruby
—We demonstrate SWITCH, a deep embedding of relational queries into RUBY and RUBY on RAILS. With SWITCH, there is no syntactic or stylistic difference between RUBY programs that ...
Torsten Grust, Manuel Mayr
EDBT
2000
ACM
14 years 1 days ago
Dynamically Optimizing High-Dimensional Index Structures
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
Christian Böhm, Hans-Peter Kriegel
EDBTW
2006
Springer
13 years 11 months ago
Using Temporal Semantics for Live Media Stream Queries
Querying live media streams is a challenging problem that becomes an essential requirement in a growing number of applications. We address the problem of evaluating continuous quer...
Bin Liu, Amarnath Gupta, Ramesh Jain
AISS
2010
113views more  AISS 2010»
13 years 5 months ago
The Object Replication Method for the Efficient Migration of Agent
The migration method of a mobile agent affects the entire performance of the distributed system. Most of the existing migration methods have the slow-witted structures due to the ...
Yonsik Lee, Kwangwoo Nam