{"id":"https://openalex.org/W2155808938","doi":"https://doi.org/10.1109/icde.2008.4497546","title":"Database Exploration Using Join Paths","display_name":"Database Exploration Using Join Paths","publication_year":2008,"publication_date":"2008-04-01","ids":{"openalex":"https://openalex.org/W2155808938","doi":"https://doi.org/10.1109/icde.2008.4497546","mag":"2155808938"},"language":"en","primary_location":{"id":"doi:10.1109/icde.2008.4497546","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.2008.4497546","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE 24th International Conference on Data Engineering","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071763795","display_name":"Cecilia M. Procopiuc","orcid":null},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Cecilia M. Procopiuc","raw_affiliation_strings":["AT and T Research Laboratories, Florham Park, NJ, USA"],"affiliations":[{"raw_affiliation_string":"AT and T Research Laboratories, Florham Park, NJ, USA","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088315797","display_name":"Divesh Srivastava","orcid":"https://orcid.org/0000-0002-7609-9217"},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Divesh Srivastava","raw_affiliation_strings":["AT and T Research Laboratories, Florham Park, NJ, USA"],"affiliations":[{"raw_affiliation_string":"AT and T Research Laboratories, Florham Park, NJ, USA","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071763795"],"corresponding_institution_ids":["https://openalex.org/I1283103587"],"apc_list":null,"apc_paid":null,"fwci":0.3666,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.70443662,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1331","last_page":"1333"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11719","display_name":"Data Quality and Management","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/join","display_name":"Join (topology)","score":0.8887991905212402},{"id":"https://openalex.org/keywords/sort-merge-join","display_name":"Sort-merge join","score":0.8594821691513062},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.748323380947113},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.6691967844963074},{"id":"https://openalex.org/keywords/hash-join","display_name":"Hash join","score":0.6043460369110107},{"id":"https://openalex.org/keywords/schema","display_name":"Schema (genetic algorithms)","score":0.5637987852096558},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5351809859275818},{"id":"https://openalex.org/keywords/table","display_name":"Table (database)","score":0.48555609583854675},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45108211040496826},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4019138216972351},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.3913625478744507},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.36395835876464844},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.26799148321151733},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16459915041923523},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1469593048095703},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.12362232804298401},{"id":"https://openalex.org/keywords/joins","display_name":"Joins","score":0.1122337281703949},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08651971817016602}],"concepts":[{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.8887991905212402},{"id":"https://openalex.org/C203570394","wikidata":"https://www.wikidata.org/wiki/Q4060688","display_name":"Sort-merge join","level":3,"score":0.8594821691513062},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.748323380947113},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.6691967844963074},{"id":"https://openalex.org/C188805328","wikidata":"https://www.wikidata.org/wiki/Q4060691","display_name":"Hash join","level":3,"score":0.6043460369110107},{"id":"https://openalex.org/C52146309","wikidata":"https://www.wikidata.org/wiki/Q7431116","display_name":"Schema (genetic algorithms)","level":2,"score":0.5637987852096558},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5351809859275818},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.48555609583854675},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45108211040496826},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4019138216972351},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.3913625478744507},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.36395835876464844},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.26799148321151733},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16459915041923523},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1469593048095703},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.12362232804298401},{"id":"https://openalex.org/C2778692605","wikidata":"https://www.wikidata.org/wiki/Q4041866","display_name":"Joins","level":2,"score":0.1122337281703949},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08651971817016602}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icde.2008.4497546","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.2008.4497546","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE 24th International Conference on Data Engineering","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W99256032","https://openalex.org/W1781748254","https://openalex.org/W1989944922","https://openalex.org/W2100913274","https://openalex.org/W2157110051","https://openalex.org/W2163372266","https://openalex.org/W4300930575","https://openalex.org/W6604050618"],"related_works":["https://openalex.org/W2381211091","https://openalex.org/W2091359263","https://openalex.org/W4283362132","https://openalex.org/W4234452035","https://openalex.org/W2469706965","https://openalex.org/W4205996836","https://openalex.org/W1866159721","https://openalex.org/W1589496614","https://openalex.org/W1989231289","https://openalex.org/W54313720"],"abstract_inverted_index":{"Complex":[0],"database":[1],"schemas":[2],"are":[3,46,82],"challenging":[4],"to":[5,10,64,73],"explore":[6],"and":[7,72],"query,":[8],"due":[9],"the":[11,19,54,75],"exponentially":[12],"many":[13],"sequences":[14],"of":[15,24,51],"join":[16,29,44,67,85],"edges":[17],"in":[18,27,53,69],"schema":[20],"graph,":[21],"not":[22],"all":[23],"which":[25,78],"result":[26],"valid":[28],"paths.":[30],"The":[31],"problem":[32],"becomes":[33],"even":[34],"more":[35],"difficult":[36],"when":[37],"tables":[38,81],"exhibit":[39],"structural":[40],"heterogeneity,":[41],"i.e.,":[42],"different":[43,49,79],"paths":[45,68,86],"meaningful":[47,66],"for":[48],"subsets":[50],"tuples":[52],"same":[55],"table.":[56,91],"In":[57],"this":[58],"paper,":[59],"we":[60],"propose":[61],"effective":[62],"ways":[63],"identify":[65],"complex":[70],"schemas,":[71],"compute":[74],"probability":[76],"with":[77],"destination":[80],"reached":[83],"via":[84],"from":[87],"a":[88],"given":[89],"source":[90]},"counts_by_year":[{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}