{"id":"https://openalex.org/W2044592312","doi":"https://doi.org/10.1145/1938551.1938562","title":"Querying probabilistic business processes for sub-flows","display_name":"Querying probabilistic business processes for sub-flows","publication_year":2011,"publication_date":"2011-02-08","ids":{"openalex":"https://openalex.org/W2044592312","doi":"https://doi.org/10.1145/1938551.1938562","mag":"2044592312"},"language":"en","primary_location":{"id":"doi:10.1145/1938551.1938562","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1938551.1938562","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th International Conference on Database Theory","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/A5073835385","display_name":"Daniel Deutch","orcid":"https://orcid.org/0009-0001-0838-0162"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Daniel Deutch","raw_affiliation_strings":["Tel Aviv University","Tel-Aviv University"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel-Aviv University","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5073835385"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":1.95868408,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.88444133,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"54","last_page":"65"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10215","display_name":"Semantic Web and Ontologies","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10215","display_name":"Semantic Web and Ontologies","score":0.9995999932289124,"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.9994000196456909,"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.9993000030517578,"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/computer-science","display_name":"Computer science","score":0.8233453035354614},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.73598313331604},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.6864913702011108},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.56972736120224},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5014317035675049},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.475094199180603},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.45988404750823975},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.45420995354652405},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.34783798456192017},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.30959826707839966},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22550207376480103},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11718350648880005}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8233453035354614},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.73598313331604},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.6864913702011108},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.56972736120224},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5014317035675049},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.475094199180603},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.45988404750823975},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.45420995354652405},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.34783798456192017},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.30959826707839966},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22550207376480103},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11718350648880005}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1938551.1938562","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1938551.1938562","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th International Conference on Database Theory","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":37,"referenced_works":["https://openalex.org/W50675760","https://openalex.org/W279525992","https://openalex.org/W1239375374","https://openalex.org/W1550331971","https://openalex.org/W1560285440","https://openalex.org/W1595179046","https://openalex.org/W1864873123","https://openalex.org/W1975612259","https://openalex.org/W1995713768","https://openalex.org/W1996923081","https://openalex.org/W2005059149","https://openalex.org/W2008279394","https://openalex.org/W2011804594","https://openalex.org/W2028357390","https://openalex.org/W2044494469","https://openalex.org/W2057411078","https://openalex.org/W2066194644","https://openalex.org/W2067754486","https://openalex.org/W2096846262","https://openalex.org/W2096899635","https://openalex.org/W2097832942","https://openalex.org/W2101251694","https://openalex.org/W2101691918","https://openalex.org/W2101742950","https://openalex.org/W2106319433","https://openalex.org/W2110429372","https://openalex.org/W2121043820","https://openalex.org/W2124324894","https://openalex.org/W2137486890","https://openalex.org/W2145066849","https://openalex.org/W2146407749","https://openalex.org/W2155733238","https://openalex.org/W2157813460","https://openalex.org/W2158766741","https://openalex.org/W2163133050","https://openalex.org/W2167246417","https://openalex.org/W3099666054"],"related_works":["https://openalex.org/W4302345037","https://openalex.org/W2731094954","https://openalex.org/W2789273959","https://openalex.org/W1998712144","https://openalex.org/W2952978498","https://openalex.org/W4292730466","https://openalex.org/W2951616510","https://openalex.org/W3122467582","https://openalex.org/W2728444714","https://openalex.org/W2354764436"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"top-k":[3],"query":[4,106,125],"evaluation":[5,107,126],"for":[6,28,60,115],"an":[7],"important":[8],"class":[9],"of":[10,24,39,77,79,119],"probabilistic":[11],"semi-structured":[12],"data:":[13],"nested":[14],"DAGs":[15],"(Directed":[16],"Acyclic":[17],"Graphs)":[18],"that":[19,35,43,97],"describe":[20],"possible":[21],"execution":[22,41],"flows":[23,42],"Business":[25],"Processes":[26],"(BPs":[27],"short).":[29],"We":[30,111],"consider":[31],"queries":[32,118],"with":[33],"projection,":[34],"select":[36],"portions":[37],"(sub-flows)":[38],"the":[40,45,75,88,113],"interest":[44],"user":[46],"and":[47,67,117,122],"are":[48,71],"most":[49],"likely":[50],"to":[51,87],"occur":[52],"at":[53],"run-time.":[54],"Retrieving":[55],"common":[56],"sub-flows":[57],"is":[58,101],"crucial":[59],"various":[61],"applications":[62],"such":[63],"as":[64],"targeted":[65],"advertisement":[66],"BP":[68],"optimization.":[69],"Sub-flows":[70],"ranked":[72],"here":[73],"by":[74],"sum":[76,99],"likelihood":[78],"EX-flows":[80],"in":[81,85,92],"which":[82],"they":[83],"appear,":[84],"contrast":[86],"max-of-likelihood":[89],"semantics":[90,100],"studied":[91],"previous":[93],"work;":[94],"we":[95],"show":[96],"while":[98],"more":[102,109],"natural,":[103],"it":[104],"makes":[105],"much":[108],"challenging.":[110],"study":[112],"problem":[114],"BPs":[116],"varying":[120],"classes":[121],"present":[123],"efficient":[124],"algorithms":[127],"whenever":[128],"possible.":[129]},"counts_by_year":[{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}