Cited By
View all- Goli VPerrizo W(1997)Application of domain vector perfect hash join for multimedia data miningProceedings of the 1997 ACM symposium on Applied computing10.1145/331697.331765(334-339)Online publication date: 1-Apr-1997
Domain vector hashing for earth system data querying
Pages 71 - 75
References
[1]
IBM Application System/400 Technology, IBM Rochester, MN, SA21-9540-0.
[2]
Babb, E.,"Implementing Relational Database by Means of Specialized Hardware," TODS, 4,1, June, 1979, pp. 87-99.
[3]
J. Blakeley, and N. Martin, "Join index, Materialized View, and Hybrid-hash Join: A performance Analysis," Proc. VI DE Conf., April, 1990, pp. 337-345.
[4]
Bloom, B. H., "Space/Time Trade-offs in hash Coding with Allowable Errors," Comm. of the ACM 13, 7, July, 1970 pp. 422-426.
[5]
Kurt P. Brown, M. J. Carey, and Miron Livny, "Managing Memory to Meet Mulficlass Workload Response Time Goals," VLDB Conf., Ireland, Aug., 1993, pp. 154-162.
[6]
D.J.DeWitt, R.H. Katz, F.Olken, L.D.Shapiro, M.R.Stonebraker and D.Wood,"Implementation Techniques for Memory Databases," SIGMOD, May, 1984, pp. 65-77.
[7]
D.J.Dewitt, and R.H. Gerber, "Multiprocessor Hash- Based Join Algorithms," Proc. Int'l Conf. on VLDB, Sweden, Aug., 1985, pp. 235.-246.
[8]
Venkata Nagarjuna Rao Goli and William Perrizo, "Multiprocessing In Join Query Acceleration: Domain Vector Perfect Hash Join Method," Proc. of the First MIDAS Conf., May, 1993, pp.106-133.
[9]
Goetz Graefe, "SortMerge-Join Idea Whose Time Has Passed," 10th DE Conf., Houston, TX, Feb, 1994, pp. 221-229.
[10]
Y. loannidis and S. Chfistodoulakis, "On the Propagation of Errors in the Size of Join Results," Proc. of ACM SIGMOD Conf., June, 1991, pp. 183-189.
[11]
Mackert, L, F., and Guy, L. M., "R* Optimizer Validation and Performance Evaluation for Distributed Queries," Proc, of Int'l Conf. on VLDB, Kyoto, Japan, Aug., 1986, pp. 149-159.
[12]
Mohan, C., Haderle, D., Wang, Y., Cheng, J., "Single Table Access Using Multiple Indexes: Control Techniques," Proc. Conf. On EDBT, Venice, March, 1990, pp. 156-165.
[13]
M.Nakayama, M. Kitsuregawa, M. Takagi, "Hash Partitioned Join Method Using Dynamic Destaging Strategy," Proc. Int'l Conf. on VLDB, Aug., 1988, pp. 267-275.
[14]
H. H. Pang, M. J. Carey and Miron Livny, "Partially Preemptible Hash Joins," ACMSiGMOD, June, 1993, pp. 1-43.
[15]
W.Perrizo, J.Gustaf$on, D.Thureen, D.Wenberg, and W.Davidson, "Domain Vector Accelerator (DVA): A Query Accelerator for Relational Operations," Proc. VII DE Conf., Feb., 1991, pp. 491-498.
[16]
W. Perrizo, P. Ram, D. Wenberg, "Distributed Join Processing Performance Evaluation," 27th Proc. Twenty Seventh Hawaii International Conf. on Software Technology, Vol II, Jan., 1994, pp. 498-505.
[17]
Ramak_dshna, M.V., and Larson, P.A:,"File Organization using Composite Perfect Hashing," ACM TODS, 14,2, June, 1989, pp. 231-263.
[18]
Ramakrishna, M.V., and Portice G.A., "Perfect Hashing Functions for Hardware Applications," Proc. VII DE Conf., Feb., 1991, pp. 464-470.
[19]
D. Schneider and D.DeWitt, "A Performance Evaluation of Four Parallel Join Algorithms in a Shared Nothing Multiprocessor Environment," Proc. of ACM SIGMOD Conf., Portland, OR, May, 1989, pp. 203-211.
[20]
Kirk Anthony Scott,Multi-Way Equijoin Query Acceleration Using Hit-Lists, Ph.D. Thesis, NDSU, 1992.
[21]
L.Shapiro, "Join Processing in Database Systems With Large Main Memories," ACM TODS, June, 1986, pp. 239-264.
[22]
Ambuj Shatdal, Jeffrey F. Naughton, "Using Shared Virtual Memory for Parallel Join Processing," ACM SIGMOD, May, 1993, pp. 119-128
[23]
Sprugnoli R.J., "Perfect Hashing Functions A Single Probe Retrieving method for Static Sets," Comm. of the ACM, 20, 11, Mar., 1977, pp. 841-850.
[24]
P.Valduriez, "Join Indices," ACM TODS, vol 12, no.2, June, 1987, pp. 218 - 246.
[25]
Philip S, Yu and Douglas W. Cornell, "Buffer Management Based on Return on Consumption in a Multi- Query Environment," VLDB Journal, 2, Feb., 1993, pp. 1-37.
[26]
Zeller, H., and Gray, J., "An Adaptive hash Join Algorithm for Multiuser Environments," Proc. of Sixteenth VLDB Conf., Aug., !990, pp. 287-296.
Index Terms
- Domain vector hashing for earth system data querying
Recommendations
DigestJoin: Exploiting Fast Random Reads for Flash-Based Joins
MDM '09: Proceedings of the 2009 Tenth International Conference on Mobile Data Management: Systems, Services and MiddlewareFlash disks have been an emerging secondary storage media. In particular, there have been portable devices, multimedia players and laptop computers that are configured with no magnetic disks but flash disks.It is envisioned that some RDBMSs will operate ...
Criss-Cross Hash Joins: Design and Analysis
Join processing in relational database systems continues to be a difficult and challenging problem. In this research, we propose a criss-cross hash join strategy that draws from both hashing and indexing techniques, inheriting the advantages of each. To ...
Temporal join processing with hilbert curve space mapping
SAC '14: Proceedings of the 29th Annual ACM Symposium on Applied ComputingManagement of data with a time dimension increases the overhead of storage and query processing in large database applications especially with the join operation, which is a commonly used and expensive relational operator. The join evaluation is ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
February 1995
604 pages
ISBN:0897916581
DOI:10.1145/315891
- Chairmen:
- Jim Hightower,
- Ed Deaton,
- Editors:
- K. M. George,
- Janice Carroll,
- Dave Oppenheim
Copyright © 1995 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- SIGAPP: ACM Special Interest Group on Applied Computing
- SIGBIOM: ACM Special Interest Group on Biomedical Computing
- SIGPLAN: ACM Special Interest Group on Programming Languages
- SIGCUE: ACM Special Interest Group on Computer Uses In Education
- SIGAda: ACM Special Interest Group on Ada Programming Language
- SIGICE: ACM Special Interest Group on Individual Computing Environment
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 26 February 1995
Check for updates
Author Tags
Qualifiers
- Article
Conference
Acceptance Rates
Overall Acceptance Rate 1,650 of 6,669 submissions, 25%
Upcoming Conference
SAC '25
- Sponsor:
- sigapp
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 229Total Downloads
- Downloads (Last 12 months)16
- Downloads (Last 6 weeks)1
Reflects downloads up to 11 Dec 2024
Other Metrics
Citations
Cited By
View all- Goli VPerrizo W(1997)Application of domain vector perfect hash join for multimedia data miningProceedings of the 1997 ACM symposium on Applied computing10.1145/331697.331765(334-339)Online publication date: 1-Apr-1997
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in