(Enter summary)
Abstract: We apply a more realistic cost model than has often been used in the past to the problems of: (1) implementing join algorithms, (2) implementing relational operations which make use of multi-attribute hash files, and (3) creating better multi-attribute hash file organisations using knowledge of the queries which will be asked. This results in a substantial improvement in performance. For some problems a performance improvement of the order of 39 is achieved. We provide preliminary evidence... (Update)
Context of citations to this paper: More
.... has been done on mining centralized databases, some promising approaches to mine distributed databases have also been developed [80, 97, 101]. With the growing popularity of the World Wide Web (WWW) mining distributed data sources becomes ever more important as the WWW...
Cited by: More
Knowledge Discovery From Distributed And Textual Data - Cho (1999)
(Correct)
Active bibliography (related documents): More All
0.5: Towards Optimal Storage Design for Efficient Query Processing in.. - Harris (1995)
(Correct)
0.4: Predicate-based Cache Management for Continuous Partial Match .. - Yon Dohn Chung
(Correct)
0.3: Optimal Clustering of Relations in a Database System - Harris, Ramamohanarao (1994)
(Correct)
Similar documents based on text: More All
0.1: Holding a Page: Enhanced Page Level Access Control for Database .. - Evan Harris
(Correct)
0.1: Using Optimized Multi-Attribute Hash Indexes For Hash Joins - Evan Harris (1993)
(Correct)
0.1: Optimal Storage Management of Relations for Join Operations - Harris, Ramamohanarao (1992)
(Correct)
Related documents from co-citation: More All
2: Programs for machine learning (context) - Quinlan - 1993
BibTeX entry: (Update)
Kotagiri R. and Harris E.P., "Effective Clustering of Records for fast Query Processing.", International Symposium on Cooperative Database Systems for Advanced Applications, pp. 358-367, 1996. 189 http://citeseer.ist.psu.edu/kotagiri96effective.html More
@inproceedings{ ramamohanarao96effective,
author = "Kotagiri Ramamohanarao and Evan P. Harris",
title = "Effective Clustering of Records for Fast Query Processing",
booktitle = "{CODAS}",
pages = "516-525",
year = "1996",
url = "citeseer.ist.psu.edu/kotagiri96effective.html" }
Citations (may not include all citations):
330
Query evaluation techniques for large databases (context) - Graefe - 1993
228
Simulated Annealing and Boltzmann Machines (context) - Aarts, Korst - 1989
162
Implementation techniques for main memory database systems (context) - DeWitt, Katz et al. - 1984
70
The BANG file: a new kind of grid file (context) - Freeston - 1987
27
Multiattribute hashing using Gray codes (context) - Faloutsos - 1986
18
Optimal partial-match retrieval when fields are independentl.. (context) - Aho, Ullman - 1979
10
Query processing method for multi-attribute clustered relati.. (context) - Harada, Nakano et al. - 1990
8
An observation on database buffering performance metrics (context) - Hagmann - 1986
6
Optimal MMI file systems for orthogonal range queries (context) - Chen, Chang et al. - 1993
3
Symbolic Gray code as a perfect multiattribute hashing schem.. (context) - Chang, Lee et al. - 1982
1
Towards optimal multi-attribute (context) - Harris, Ramamohanarao
Documents on the same site (http://munkora.cs.mu.oz.au/publications/tr_db/TR.html): More
Optimal Clustering of Relations in a Database System - Harris, Ramamohanarao (1994)
(Correct)
Multiple Paths Join for Nested Relational Databases - Liu, Ramamohanarao (1993)
(Correct)
Coroutining and the Construction of Terminating Logic Programs - Naish (1992)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC