Efficient discovery of join plans in schemaless data

Simple item page
dc.citation.epage11en_US
dc.citation.spage1en_US
dc.contributor.authorAcar, Aybar C.en_US
dc.contributor.authorMotro, A.en_US
dc.coverage.spatialCetraro - Calabria, Italy
dc.date.accessioned2016-02-08T12:27:22Z
dc.date.available2016-02-08T12:27:22Z
dc.date.issued2009-09en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.descriptionDate of Conference: 16-18 September, 2009
dc.descriptionConference name: IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
dc.description.abstractWe describe a method of inferring join plans for a set of relation instances, in the absence of any metadata, such as attribute domains, attribute names, or constraints (e.g., keys or foreign keys). Our method enumerates the possible join plans in order of likelihood, based on the compatibility of a pair of columns and their suitability as join attributes (i.e. their appropriateness as keys). We outline two variants of the approach. The first variant is accurate but potentially time-consuming, especially for large relations that do not fit in memory. The second variant is an approximation of the former and hence less accurate, but is considerably more efficient, allowing the method to be used online, even for large relations. We provide experimental results showing how both forms scale in terms of performance as the number of candidate join attributes and the size of the relations increase. We also characterize the accuracy of the approximate variant with respect to the exact variant. Copyright ©2009 ACM.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T12:27:22Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2009en
dc.identifier.doi10.1145/1620432.1620434en_US
dc.identifier.urihttp://hdl.handle.net/11693/28695
dc.language.isoEnglishen_US
dc.publisherACM
dc.relation.isversionofhttp://dx.doi.org/10.1145/1620432.1620434en_US
dc.source.titleIDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposiumen_US
dc.subjectDependency inferenceen_US
dc.subjectJoin inferenceen_US
dc.subjectSchema matchingen_US
dc.subjectForeign keysen_US
dc.subjectMetadataen_US
dc.subjectKeys (for locks)en_US
dc.titleEfficient discovery of join plans in schemaless dataen_US
dc.typeConference Paperen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Efficient discovery of join plans in schemaless data.pdf
Size:
830.26 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Computer Engineering