{"id":"https://openalex.org/W2161123625","doi":"https://doi.org/10.1145/1807167.1807241","title":"Lineage processing over correlated probabilistic databases","display_name":"Lineage processing over correlated probabilistic databases","publication_year":2010,"publication_date":"2010-06-06","ids":{"openalex":"https://openalex.org/W2161123625","doi":"https://doi.org/10.1145/1807167.1807241","mag":"2161123625"},"language":"en","primary_location":{"id":"doi:10.1145/1807167.1807241","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1807167.1807241","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2010 ACM SIGMOD International Conference on Management of data","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/A5057677675","display_name":"Bhargav Kanagal","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Bhargav Kanagal","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113637223","display_name":"Amol Deshpande","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amol Deshpande","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5057677675"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":5.075,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.96062992,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"675","last_page":"686"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9993000030517578,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9991000294685364,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.8028396368026733},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.7329485416412354},{"id":"https://openalex.org/keywords/probabilistic-database","display_name":"Probabilistic database","score":0.6894177198410034},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6391197443008423},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49738815426826477},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4721301198005676},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.47152194380760193},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.45360124111175537},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.4473534822463989},{"id":"https://openalex.org/keywords/conjunctive-query","display_name":"Conjunctive query","score":0.44584783911705017},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.43298614025115967},{"id":"https://openalex.org/keywords/independence","display_name":"Independence (probability theory)","score":0.4253196716308594},{"id":"https://openalex.org/keywords/uncertain-data","display_name":"Uncertain data","score":0.4113995134830475},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3437972664833069},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.31044894456863403},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.291412353515625},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23732036352157593},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17793026566505432},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.16398218274116516},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.14237189292907715},{"id":"https://openalex.org/keywords/database-theory","display_name":"Database theory","score":0.1367799937725067},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12211397290229797}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.8028396368026733},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.7329485416412354},{"id":"https://openalex.org/C174539288","wikidata":"https://www.wikidata.org/wiki/Q7246853","display_name":"Probabilistic database","level":4,"score":0.6894177198410034},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6391197443008423},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49738815426826477},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4721301198005676},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.47152194380760193},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.45360124111175537},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4473534822463989},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.44584783911705017},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.43298614025115967},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.4253196716308594},{"id":"https://openalex.org/C2778865114","wikidata":"https://www.wikidata.org/wiki/Q7882489","display_name":"Uncertain data","level":2,"score":0.4113995134830475},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3437972664833069},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.31044894456863403},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.291412353515625},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23732036352157593},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17793026566505432},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.16398218274116516},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.14237189292907715},{"id":"https://openalex.org/C12439846","wikidata":"https://www.wikidata.org/wiki/Q4809258","display_name":"Database theory","level":3,"score":0.1367799937725067},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12211397290229797},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1807167.1807241","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1807167.1807241","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2010 ACM SIGMOD International Conference on Management of data","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.207.2917","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.207.2917","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umd.edu/~bhargav/sigmod458-kanagal.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W162422970","https://openalex.org/W1484324861","https://openalex.org/W1513861746","https://openalex.org/W1575805590","https://openalex.org/W1587990862","https://openalex.org/W1996544809","https://openalex.org/W2002722727","https://openalex.org/W2020999234","https://openalex.org/W2041358936","https://openalex.org/W2049073556","https://openalex.org/W2049711652","https://openalex.org/W2078686663","https://openalex.org/W2092819480","https://openalex.org/W2096219859","https://openalex.org/W2101914010","https://openalex.org/W2102349221","https://openalex.org/W2110138423","https://openalex.org/W2112070477","https://openalex.org/W2112630366","https://openalex.org/W2114242687","https://openalex.org/W2118178019","https://openalex.org/W2120825705","https://openalex.org/W2125806118","https://openalex.org/W2125984043","https://openalex.org/W2143485006","https://openalex.org/W2153508518","https://openalex.org/W2159080219","https://openalex.org/W2171776999","https://openalex.org/W2752885492","https://openalex.org/W3145128584","https://openalex.org/W4250143236","https://openalex.org/W4285719527","https://openalex.org/W6662700961","https://openalex.org/W6682435157","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W1505212787","https://openalex.org/W4226251578","https://openalex.org/W2127795772","https://openalex.org/W2113053869","https://openalex.org/W1876081586","https://openalex.org/W2118370002","https://openalex.org/W3170346938","https://openalex.org/W2147835952","https://openalex.org/W2595974764","https://openalex.org/W2131209872"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,24,30,51,140,157,192],"address":[4],"the":[5,35,41,44,62,106,112,115,129,165,179,187,217,223],"problem":[6],"of":[7,34,43,68,108,111,114,131,189,200,225],"scalably":[8],"evaluating":[9,74],"conjunctive":[10,85],"queries":[11],"over":[12,89,233],"correlated":[13,98,120,175,234],"probabilistic":[14,92,99,176,235],"databases":[15,100,177],"containing":[16],"tuple":[17,90],"or":[18],"attribute":[19],"uncertainties.":[20],"Like":[21],"previous":[22,49],"work,":[23,50],"adopt":[25],"a":[26,66,119,123,145,198],"two-phase":[27],"approach":[28],"where":[29],"first":[31],"compute":[32,40,141],"lineages":[33,79,134,152,201],"output":[36],"tuples,":[37],"and":[38,55,150,207],"then":[39],"probabilities":[42,143],"lineage":[45,116,190,231],"formulas.":[46],"However":[47],"unlike":[48],"allow":[52],"for":[53,96,151,229],"arbitrary":[54],"complex":[56],"correlations":[57],"to":[58,128,163,172,196,208],"be":[59],"present":[60],"in":[61,137,216],"data,":[63],"captured":[64],"via":[65],"forest":[67],"junction":[69],"trees.":[70],"We":[71,104,168],"observe":[72],"that":[73,135,153,213],"even":[75],"read-once":[76],"(tree":[77],"structured)":[78],"(e.g.,":[80],"those":[81],"generated":[82],"by":[83,202],"hierarchical":[84],"queries),":[86],"polynomially":[87],"computable":[88],"independent":[91],"databases,":[93],"is":[94],"#P-complete":[95],"lightly":[97],"like":[101],"Markov":[102],"sequences.":[103],"characterize":[105],"complexity":[107,188],"exact":[109,142],"computation":[110,204],"probability":[113],"formula":[117],"on":[118],"database":[121],"using":[122,144,178,226],"parameter":[124],"called":[125],"lwidth":[126],"(analogous":[127],"notion":[130],"treewidth).":[132],"For":[133],"result":[136,166],"low":[138],"lwidth,":[139],"novel":[146],"message":[147],"passing":[148],"algorithm,":[149],"induce":[154],"large":[155,174],"lwidths,":[156],"develop":[158,193],"approximate":[159],"Monte":[160],"Carlo":[161],"algorithms":[162,171,228],"estimate":[164],"probabilities.":[167],"scale":[169],"our":[170,227],"very":[173],"previously":[180],"proposed":[181],"INDSEP":[182],"data":[183],"structure.":[184],"To":[185],"mitigate":[186],"evaluation,":[191],"optimization":[194],"techniques":[195],"process":[197],"batch":[199],"sharing":[203],"across":[205],"formulas,":[206],"exploit":[209],"any":[210],"independence":[211],"relationships":[212],"may":[214],"exist":[215],"data.":[218],"Our":[219],"experimental":[220],"study":[221],"illustrates":[222],"benefits":[224],"processing":[230],"formulas":[232],"databases.":[236]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
