Sciweavers

8953 search results - page 65 / 1791
» Parallel Query Processing
Sort
View
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...
VLDB
2007
ACM
166views Database» more  VLDB 2007»
14 years 1 months ago
To Share or Not To Share?
Intuitively, aggressive work sharing among concurrent queries in a database system should always improve performance by eliminating redundant computation or data accesses. We show...
Ryan Johnson, Nikos Hardavellas, Ippokratis Pandis...
KDD
1994
ACM
82views Data Mining» more  KDD 1994»
13 years 11 months ago
Architectural Support for Data Mining
Oneof the mainobstacles in applying data mining techniques to large, real-world databasesis the lack of efficient data management.In this paper, wepresent the design and implement...
Marcel Holsheimer, Martin L. Kersten
HPDC
2010
IEEE
13 years 8 months ago
Distributing the power of OLAP
In this paper we present the Brown Dwarf, a distributed system designed to efficiently store, query and update multidimensional data over an unstructured Peer-to-Peer overlay, wit...
Katerina Doka, Dimitrios Tsoumakos, Nectarios Kozi...
EDBT
2004
ACM
155views Database» more  EDBT 2004»
14 years 7 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher