Sven Helmer, Guido Moerkotte  Home/Search
Context Related
| pi3.informatik.unimannhe...MA9613.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: pi3.informatik.uni...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Current data models like the NF 2 model and object-oriented models support setvalued attributes. Hence, it becomes possible to have join predicates based on set comparison. This paper introduces and evaluates several main memory algorithms to evaluate efficiently this kind of join. More specifically, we concentrate on the set equality and the subset predicates. 1 Introduction Since the invention of relational database systems, tremendous effort has been undertaken in order to develop... (Update)
Context of citations to this paper: More
...[4] that, for sets of length T, the length of the signatures has to be equal to: F mT=ln2 Henceforth, based on the approach of Ref. [12] for the case of set valued object databases, we assume that m is equal to one. Given a collection of sequential patterns, in Section 4 we...
Cited by: More
GRUBJOIN: An Adaptive Multi-Way Windowed Stream Join with.. - Gedik, Wu, Yu, Liu (2005) (Correct)
Symmetric Relations and Cardinality-Bounded Multisets in.. - Kenneth Ross Julia (2004) (Correct)
Unknown - (Correct)
Similar documents (at the sentence level):
24.9%: Evaluation of Main Memory Join Algorithms for Joins with.. - Helmer, Moerkotte (1997) (Correct)
Active bibliography (related documents): More All
1.7: Diag-Join: An Opportunistic Join Algorithm for 1:N.. - Helmer, Westmann.. (1997) (Correct)
0.7: Bucket Skip Merge Join: A Scalable Algorithm for Join.. - Kamath, Ramamritham (1996) (Correct)
0.4: A Comprehensive Survey of Join Techniques in Relational Databases - Yang, Singhal (1997) (Correct)
Similar documents based on text: More All
0.5: Nested Queries and Quantifiers in an Ordered Context - May, Helmer, Moerkotte (2004) (Correct)
0.5: Set Containment Joins: The Good, The Bad and The Ugly - Ramasamy, Patel, Kaushik.. (Correct)
0.4: A Study of Four Index Structures for Set-Valued Attributes.. - Helmer, Moerkotte (1999) (Correct)
Related documents from co-citation: More All
6: Query evaluation techniques for large databases (context) - Graefe - 1993
5: The Object Database Standard: ODMG (context) - Cattell - 1993
5: Efficient Evaluation of Aggregates on Bulk Types - Cluet, Moerkotte - 1995
BibTeX entry: (Update)
S. Helmer and G. Moerkotte. Evaluation of main memory join algorithms for joins with set comparison join predicates. Technical Report 13/96, University of Mannheim, Mannheim, Germany, 1996. http://citeseer.ist.psu.edu/article/helmer96evaluation.html More
@inproceedings{ helmer97evaluation,
author = "Sven Helmer and Guido Moerkotte",
title = "Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates",
booktitle = "The {VLDB} Journal",
pages = "386-395",
year = "1997",
url = "citeseer.ist.psu.edu/article/helmer96evaluation.html" }
Citations (may not include all citations):619 The Object Database Standard: ODMG (context) - Cattell - 1996
162 Implementation techniques for main memory database systems (context) - DeWitt, Katz et al. - 1984
159 Efficient processing of spatial joins using R-trees (context) - Brinkhoff, Kriegel et al. - 1993
134 The relational model with relation-valued attributes (context) - Schek, Scholl - 1986
115 Partition based spatial-merge join - Patel, DeWitt - 1996
81 Spatial hash-joins - Lo, Ravishankar - 1996
69 Multiprocessor hash-based join algorithms - DeWitt, Gerber - 1985
67 An evaluation of non-equijoin algorithms - DeWitt, Naughton et al. - 1991
59 A performance evaluation of pointer-based joins (context) - Shekita, Carey - 1990
57 Hashing methods and relational algebra operations (context) - Bratbergsengen - 1984
56 Multi-table joins through bitmapped join indices (context) - O'Neil, Graefe - 1995
53 Efficient computation of spatial joins - Gunther - 1993
51 Parallel sorting on a shared-nothing architecture using prob.. - DeWitt, Naughton et al. - 1991
50 Signature files: An access method for documents and its anal.. (context) - Faloutsos, Christodoulakis - 1984
49 Indexing techniques for object-oriented databases (context) - Kim, Kim et al. - 1989
34 Evaluation of signature files as set access facilities in oo.. - Ishikawa, Kitagawa et al. - 1993
34 Rapid bushy join-order optimization with cartesian products - Vance, Maier - 1996
33 Hash-partitioned join method using dynamic destaging strateg.. (context) - Nakayama, Kitsuregawa et al. - 1988
28 Partial-match retrieval via the method of superimposed codes (context) - Roberts - 1979
26 The effect of bucket size tuning in the dynamic hybrid GRACE.. (context) - Kitsuregawa, Nakayama et al. - 1989
24 on Database Systems (context) - Valduriez, ACM - 1987
22 A two level superimposed coding scheme for partial match ret.. (context) - Sacks-Davis, Ramamohanarao - 1983
19 Benchmarking spatial join operations with spatial output - Hoel, Samet - 1995
19 Sort-merge-join: An idea whose time has (context) - Graefe - 1994
16 Indexing multiple sets - Kilger, Moerkotte - 1994
15 Partitioned signature files: Design issues and performance e.. (context) - Lee, Leng - 1989
14 Efficient evaluation of aggregates on bulk types - Cluet, Moerkotte - 1995
14 FastSort: an distributed single-input single-output external.. (context) - Salzberg, Tsukerman et al. - 1990
13 Pointer-based join techniques for object-oriented databases - DeWitt, Lieuwen et al. - 1993
11 An overview of the systems software of a parallel relational.. (context) - Fushimi, Kitsuregawa et al. - 1986
10 Sort versus hash revisited (context) - Graefe, Linville et al. - 1994
9 A low communication sort algorithm for a parallel database m.. (context) - Lorie, Young - 1989
8 the evaluation of queries in a relational database system (context) - Blasgen, Eswaran - 1976
7 Implementing a generalized access path structure for a relat.. (context) - Harder - 1978
7 A new join algorithm (context) - Shin, Meltzer - 1994
5 A study of sort algorithms for multiprocessor DB machines (context) - Menon - 1986
4 Bucket skip merge join: A scalable algorithm for jo (context) - Kamath, Ramamritham - 1996
2 Extending relational algebra and calculus for nested relatio.. (context) - Roth, Korth et al. - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://pi3.informatik.uni-mannheim.de/publications.html): More
Constructing Optimal Bushy Processing Trees for Join.. - Scheufele, Moerkotte (1996) (Correct)
Evaluating Queries with Generalized Path Expressions - Vassilis Christophides (1996) (Correct)
Bypassing Joins in Disjunctive Queries - Steinbrunn, Peithner, Moerkotte.. (1995) (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