Sciweavers

1300 search results - page 87 / 260
» XML Query Processing and Optimization
Sort
View
SSDBM
2010
IEEE
127views Database» more  SSDBM 2010»
14 years 24 days ago
Optimizing All-Nearest-Neighbor Queries with Trigonometric Pruning
Many applications require to determine the k-nearest neighbors for multiple query points simultaneously. This task is known as all-(k)-nearest-neighbor (AkNN) query. In this paper,...
Tobias Emrich, Franz Graf, Hans-Peter Kriegel, Mat...
ACSD
2005
IEEE
153views Hardware» more  ACSD 2005»
14 years 1 months ago
BoPi - A Distributed Machine for Experimenting Web Services Technologies
BoPi is a programming language with a runtime support that allows the distribution and the execution of programs over the network. The language is a process calculus with XML valu...
Samuele Carpineti, Cosimo Laneve, Paolo Milazzo
DAWAK
2006
Springer
13 years 11 months ago
A Greedy Approach to Concurrent Processing of Frequent Itemset Queries
We consider the problem of concurrent execution of multiple frequent itemset queries. If such data mining queries operate on overlapping parts of the database, then their overall I...
Pawel Boinski, Marek Wojciechowski, Maciej Zakrzew...
ICDE
2012
IEEE
224views Database» more  ICDE 2012»
11 years 10 months ago
Exploiting Common Subexpressions for Cloud Query Processing
—Many companies now routinely run massive data analysis jobs – expressed in some scripting language – on large clusters of low-end servers. Many analysis scripts are complex ...
Yasin N. Silva, Paul-Ake Larson, Jingren Zhou
FQAS
2006
Springer
99views Database» more  FQAS 2006»
13 years 11 months ago
Partition-Based Approach to Processing Batches of Frequent Itemset Queries
We consider the problem of optimizing processing of batches of frequent itemset queries. The problem is a particular case of multiple-query optimization, where the goal is to minim...
Przemyslaw Grudzinski, Marek Wojciechowski, Maciej...