Sciweavers

1160 search results - page 210 / 232
» Query Processing and Optimization for Pictorial Query Trees
Sort
View
EDBT
2009
ACM
175views Database» more  EDBT 2009»
15 years 4 months ago
Towards materialized view selection for distributed databases
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
Leonardo Weiss Ferreira Chaves, Erik Buchmann, Fab...
SIGMOD
2004
ACM
162views Database» more  SIGMOD 2004»
15 years 10 months ago
Graph Indexing: A Frequent Structure-based Approach
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is...
Xifeng Yan, Philip S. Yu, Jiawei Han
PODS
1994
ACM
138views Database» more  PODS 1994»
15 years 2 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
CIKM
2006
Springer
15 years 1 months ago
KDDCS: a load-balanced in-network data-centric storage scheme for sensor networks
We propose an In-Network Data-Centric Storage (INDCS) scheme for answering ad-hoc queries in sensor networks. Previously proposed In-Network Storage (INS) schemes suffered from St...
Mohamed Aly, Kirk Pruhs, Panos K. Chrysanthis
BNCOD
2003
127views Database» more  BNCOD 2003»
14 years 11 months ago
Performance Evaluation and Analysis of K-Way Join Variants for Association Rule Mining
Data mining aims at discovering important and previously unknown patterns from the dataset in the underlying database. Database mining performs mining directly on data stored in r...
P. Mishra, Sharma Chakravarthy