Aufgrund von Vorbereitungen auf eine neue Version von KOPS, können am Montag, 6.2. und Dienstag, 7.2. keine Publikationen eingereicht werden. (Due to preparations for a new version of KOPS, no publications can be submitted on Monday, Feb. 6 and Tuesday, Feb. 7.)
Type of Publication: | Contribution to a conference collection |
URI (citable link): | http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-15441 |
Author: | Rich, Christian; Rosenthal, Arnon; Scholl, Marc H. |
Year of publication: | 1993 |
Conference: | Information Systems and Management of Data, Oct, 1993, Delhi, India |
Published in: | Proc. International Conference on Information Systems and Management of Data, Delhi, India, October 1993 |
Summary: |
Most join algorithms can be extended to reduce wasted work when several tuples contain the same value of the join attribute. We show that separating detection of duplicates from their exploitation improves modularity and makes it easier to implement whole families of hierarchy exploiting join algorithms that avoid duplication. The technique is also used to provide an execution technique for star like patterns of joins around a central relation. It dominates Ingres like substitution for the central relation, in both performance and ease of including in a conventional optimizer. Its performance dominates a cascade of conventional binary joins, and performance estimates are more accurate. We then argue that such techniques make it undesirable to implement physical level multiway join operations within a query processor.
|
Subject (DDC): | 004 Computer Science |
Comment on publication: | Also publ. as: Technical Report 172, ETH Zürich, Institute of Theoretical Computer Science |
Link to License: | In Copyright |
RICH, Christian, Arnon ROSENTHAL, Marc H. SCHOLL, 1993. Reducing Duplicate Work in Relational Join(s) : a Unified Approach. Information Systems and Management of Data. Delhi, India, Oct, 1993. In: Proc. International Conference on Information Systems and Management of Data, Delhi, India, October 1993
@inproceedings{Rich1993Reduc-5961, title={Reducing Duplicate Work in Relational Join(s) : a Unified Approach}, year={1993}, booktitle={Proc. International Conference on Information Systems and Management of Data, Delhi, India, October 1993}, author={Rich, Christian and Rosenthal, Arnon and Scholl, Marc H.}, note={Also publ. as: Technical Report 172, ETH Zürich, Institute of Theoretical Computer Science} }
<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/5961"> <dc:creator>Rosenthal, Arnon</dc:creator> <dcterms:bibliographicCitation>Aus: Proc. International Conference on Information Systems and Management of Data, Delhi, India, October 1993</dcterms:bibliographicCitation> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:language>eng</dc:language> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5961/1/Reducing_Duplicate_Work_1993.pdf"/> <dc:contributor>Scholl, Marc H.</dc:contributor> <dcterms:abstract xml:lang="eng">Most join algorithms can be extended to reduce wasted work when several tuples contain the same value of the join attribute. We show that separating detection of duplicates from their exploitation improves modularity and makes it easier to implement whole families of hierarchy exploiting join algorithms that avoid duplication. The technique is also used to provide an execution technique for star like patterns of joins around a central relation. It dominates Ingres like substitution for the central relation, in both performance and ease of including in a conventional optimizer. Its performance dominates a cascade of conventional binary joins, and performance estimates are more accurate. We then argue that such techniques make it undesirable to implement physical level multiway join operations within a query processor.</dcterms:abstract> <dc:creator>Scholl, Marc H.</dc:creator> <dc:rights>terms-of-use</dc:rights> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5961/1/Reducing_Duplicate_Work_1993.pdf"/> <dcterms:issued>1993</dcterms:issued> <dc:contributor>Rosenthal, Arnon</dc:contributor> <dc:format>application/pdf</dc:format> <dc:creator>Rich, Christian</dc:creator> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:08:24Z</dc:date> <dc:contributor>Rich, Christian</dc:contributor> <dcterms:title>Reducing Duplicate Work in Relational Join(s) : a Unified Approach</dcterms:title> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5961"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:08:24Z</dcterms:available> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> </rdf:Description> </rdf:RDF>
Reducing_Duplicate_Work_1993.pdf | 149 |