{"id":"https://openalex.org/W2033964567","doi":"https://doi.org/10.1109/icdim.2007.369356","title":"A Bottom-up Strategy for Query Decomposition","display_name":"A Bottom-up Strategy for Query Decomposition","publication_year":2007,"publication_date":"2007-04-01","ids":{"openalex":"https://openalex.org/W2033964567","doi":"https://doi.org/10.1109/icdim.2007.369356","mag":"2033964567"},"language":"en","primary_location":{"id":"doi:10.1109/icdim.2007.369356","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdim.2007.369356","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 1st International Conference on Digital Information Management","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/A5071997652","display_name":"Le Thi Thu Thuy","orcid":"https://orcid.org/0000-0002-7571-3713"},"institutions":[{"id":"https://openalex.org/I106938459","display_name":"University of New Brunswick","ror":"https://ror.org/05nkf0n29","country_code":"CA","type":"education","lineage":["https://openalex.org/I106938459"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Le Thi Thu Thuy","raw_affiliation_strings":["University of New Brunswick, Fredericton, NB, Canada"],"affiliations":[{"raw_affiliation_string":"University of New Brunswick, Fredericton, NB, Canada","institution_ids":["https://openalex.org/I106938459"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062241733","display_name":"Doan Dai Duong","orcid":null},"institutions":[{"id":"https://openalex.org/I106938459","display_name":"University of New Brunswick","ror":"https://ror.org/05nkf0n29","country_code":"CA","type":"education","lineage":["https://openalex.org/I106938459"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Doan Dai Duong","raw_affiliation_strings":["University of New Brunswick, Fredericton, NB, Canada","Fac. of Comput. Sci, Univ. of New Brunswick, Fredericton, NB"],"affiliations":[{"raw_affiliation_string":"University of New Brunswick, Fredericton, NB, Canada","institution_ids":["https://openalex.org/I106938459"]},{"raw_affiliation_string":"Fac. of Comput. Sci, Univ. of New Brunswick, Fredericton, NB","institution_ids":["https://openalex.org/I106938459"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111680679","display_name":"Virendrakumar C. Bhavsar","orcid":null},"institutions":[{"id":"https://openalex.org/I106938459","display_name":"University of New Brunswick","ror":"https://ror.org/05nkf0n29","country_code":"CA","type":"education","lineage":["https://openalex.org/I106938459"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Virendrakumar C. Bhavsar","raw_affiliation_strings":["University of New Brunswick, Fredericton, NB, Canada","Fac. of Comput. Sci, Univ. of New Brunswick, Fredericton, NB"],"affiliations":[{"raw_affiliation_string":"University of New Brunswick, Fredericton, NB, Canada","institution_ids":["https://openalex.org/I106938459"]},{"raw_affiliation_string":"Fac. of Comput. Sci, Univ. of New Brunswick, Fredericton, NB","institution_ids":["https://openalex.org/I106938459"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001111183","display_name":"Harold Boley","orcid":"https://orcid.org/0000-0002-8940-7469"},"institutions":[{"id":"https://openalex.org/I197604219","display_name":"National Academies of Sciences, Engineering, and Medicine","ror":"https://ror.org/02eq2w707","country_code":"US","type":"government","lineage":["https://openalex.org/I197604219"]},{"id":"https://openalex.org/I4210159778","display_name":"National Research Council Canada","ror":"https://ror.org/04mte1k06","country_code":"CA","type":"government","lineage":["https://openalex.org/I4210159778"]}],"countries":["CA","US"],"is_corresponding":false,"raw_author_name":"Harold Boley","raw_affiliation_strings":["Institute for Information Technology-e-Business, National Research Council Canada, Fredericton, NB, Canada","Institute for Information Technology - e-Business, National Research Council of Canada, Fredericton, New Brunswick, Canada. harold.boley@nrc-cnrc.gc.ca"],"affiliations":[{"raw_affiliation_string":"Institute for Information Technology-e-Business, National Research Council Canada, Fredericton, NB, Canada","institution_ids":["https://openalex.org/I4210159778"]},{"raw_affiliation_string":"Institute for Information Technology - e-Business, National Research Council of Canada, Fredericton, New Brunswick, Canada. harold.boley@nrc-cnrc.gc.ca","institution_ids":["https://openalex.org/I197604219"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5071997652"],"corresponding_institution_ids":["https://openalex.org/I106938459"],"apc_list":null,"apc_paid":null,"fwci":1.2835,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.81753687,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"215","last_page":"221"},"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.9997000098228455,"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.9997000098228455,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9962000250816345,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/xpath","display_name":"XPath","score":0.8070699572563171},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6452460885047913},{"id":"https://openalex.org/keywords/schema","display_name":"Schema (genetic algorithms)","score":0.5215834975242615},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4678298532962799},{"id":"https://openalex.org/keywords/executable","display_name":"Executable","score":0.4575127959251404},{"id":"https://openalex.org/keywords/path-expression","display_name":"Path expression","score":0.4552955627441406},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.44066035747528076},{"id":"https://openalex.org/keywords/query-language","display_name":"Query language","score":0.4223838746547699},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42186418175697327},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.4132170081138611},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3822394013404846},{"id":"https://openalex.org/keywords/xml","display_name":"XML","score":0.27565497159957886},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.27342867851257324},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25452905893325806},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.18300685286521912},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.16039133071899414},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09849253296852112}],"concepts":[{"id":"https://openalex.org/C2780213375","wikidata":"https://www.wikidata.org/wiki/Q16340","display_name":"XPath","level":4,"score":0.8070699572563171},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6452460885047913},{"id":"https://openalex.org/C52146309","wikidata":"https://www.wikidata.org/wiki/Q7431116","display_name":"Schema (genetic algorithms)","level":2,"score":0.5215834975242615},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4678298532962799},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.4575127959251404},{"id":"https://openalex.org/C61114434","wikidata":"https://www.wikidata.org/wiki/Q7144649","display_name":"Path expression","level":3,"score":0.4552955627441406},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.44066035747528076},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.4223838746547699},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42186418175697327},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.4132170081138611},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3822394013404846},{"id":"https://openalex.org/C8797682","wikidata":"https://www.wikidata.org/wiki/Q2115","display_name":"XML","level":2,"score":0.27565497159957886},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.27342867851257324},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25452905893325806},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.18300685286521912},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.16039133071899414},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09849253296852112},{"id":"https://openalex.org/C55348073","wikidata":"https://www.wikidata.org/wiki/Q595926","display_name":"XML validation","level":3,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icdim.2007.369356","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdim.2007.369356","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 1st International Conference on Digital Information Management","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W72072266","https://openalex.org/W188870210","https://openalex.org/W1965307326","https://openalex.org/W2052409393","https://openalex.org/W2105824512","https://openalex.org/W2112468288","https://openalex.org/W2114036697","https://openalex.org/W2153529441","https://openalex.org/W2170192471","https://openalex.org/W4248717900","https://openalex.org/W6602972799","https://openalex.org/W6607783174"],"related_works":["https://openalex.org/W1534104849","https://openalex.org/W2068852373","https://openalex.org/W2124793519","https://openalex.org/W1958678540","https://openalex.org/W2146310406","https://openalex.org/W3164787465","https://openalex.org/W2294034341","https://openalex.org/W1779612025","https://openalex.org/W2950897092","https://openalex.org/W1608399088"],"abstract_inverted_index":{"In":[0,62,181],"order":[1],"to":[2,80,111,120,134,217],"access":[3],"data":[4,8,36],"from":[5,109,117],"various":[6],"different":[7],"repositories,":[9],"in":[10,98,151,177],"global-as-view":[11],"approaches":[12,136],"an":[13,65,87],"input":[14,66],"query":[15,67],"is":[16,24,48,60,68,78,115,172,198,208],"decomposed":[17,70],"into":[18,71,90],"several":[19],"subqueries.":[20],"Normally,":[21],"this":[22],"decomposition":[23],"based":[25],"on":[26,128],"a":[27,39,49,82,106,124,178,186,218],"set":[28],"of":[29,35,56,105,123,130,158,168,175,189,195,203],"mappings,":[30],"which":[31],"describe":[32],"the":[33,54,118,121,152,155,173,182,192,221],"correspondence":[34],"elements":[37],"between":[38],"global":[40,83,179],"schema":[41],"and":[42,126,140],"local":[43,58,91,99,131,227],"ones.":[44],"However,":[45],"building":[46],"mappings":[47],"difficult":[50],"task,":[51],"especially":[52],"when":[53],"number":[55,174],"participating":[57],"schemas":[59],"large.":[61],"our":[63,143,159,196],"approach,":[64],"automatically":[69],"subqueries":[72,225],"without":[73],"using":[74],"mappings.":[75],"An":[76],"algorithm":[77,102,160,197],"proposed":[79],"transform":[81],"path":[84,92,107],"expression":[85,108],"(e.g.,":[86,94,228],"XPath":[88,95],"query)":[89],"expressions":[93],"queries)":[96],"executable":[97],"schemas.":[100,132,230],"This":[101,113,214],"transforms":[103],"parts":[104,176],"right":[110],"left.":[112],"transformation":[114],"applied":[116],"bottom":[119],"top":[122],"tree":[125,188],"depends":[127],"structures":[129],"Compared":[133],"top-down":[135],"as":[137],"by":[138],"Lausen":[139],"Marron":[141],"(IM),":[142],"bottom-up":[144],"approach":[145],"can":[146,161,215],"be":[147,162],"more":[148],"efficient.":[149],"Even":[150],"worst":[153],"case,":[154,184],"time":[156,193,222],"complexity":[157,194],"n":[163,171],"times":[164],"better":[165],"than":[166],"that":[167,202],"IM,":[169],"where":[170],"query.":[180],"best":[183],"for":[185,223,226],"k-ary":[187],"height":[190],"h,":[191],"T(n,k,h)=":[199],"min(n,h),":[200],"whereas":[201],"LM":[204],"we":[205],"have":[206],"found":[207],"T(n,k,h,)=n*(k":[209],"<sup":[210],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[211],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">h+1</sup>":[212],"-1)/(k-1)":[213],"reduce":[216],"large":[219],"extent":[220],"forming":[224],"XMI)":[229]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}