649 search results - page 4 / 130 » Improved and Optimized Partitioning Techniques in Database Q... |
SIGMOD
2010
ACM
13 years 4 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
SIGMOD
2002
ACM
14 years 6 months ago
2002
ACM
Physical database design is important for query performance in a shared-nothing parallel database system, in which data is horizontally partitioned among multiple independent node...
SIGMOD
2005
ACM
14 years 6 months ago
2005
ACM
Searching for all occurrences of a twig pattern in an XML document is an important operation in XML query processing. Recently a holistic method TwigStack [2] has been proposed. T...
VLDB
1992
ACM
13 years 9 months ago
1992
ACM
In this paper, we discuss issues involving temporal data fragmentation, temporal query processing, and query optimization in multiprocessor database machines. We propose parallel ...
FQAS
2006
Springer
13 years 9 months ago
2006
Springer
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...