{"id":"https://openalex.org/W2167527087","doi":"https://doi.org/10.1109/icde.1987.7272365","title":"On the evaluation of recursion in (deductive) database systems by efficient differential fixpoint iteration","display_name":"On the evaluation of recursion in (deductive) database systems by efficient differential fixpoint iteration","publication_year":1987,"publication_date":"1987-02-01","ids":{"openalex":"https://openalex.org/W2167527087","doi":"https://doi.org/10.1109/icde.1987.7272365","mag":"2167527087"},"language":"en","primary_location":{"id":"doi:10.1109/icde.1987.7272365","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.1987.7272365","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"1987 IEEE Third 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/A5061806234","display_name":"Ulrich G\u00fcntzer","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ulrich G\u00fcntzer","raw_affiliation_strings":["Institut für Informatik, Technische Universität München, FRG, EARN: G11H11, DM0TUI1S, Germany"],"affiliations":[{"raw_affiliation_string":"Institut für Informatik, Technische Universität München, FRG, EARN: G11H11, DM0TUI1S, Germany","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112177348","display_name":"Werner Kie\u00dfling","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Werner Kiessling","raw_affiliation_strings":["MAD Intelligent Systems, München, Germany"],"affiliations":[{"raw_affiliation_string":"MAD Intelligent Systems, München, Germany","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110020072","display_name":"Rudolf Bayer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rudolf Bayer","raw_affiliation_strings":["Institut für Informatik, Technische Universität München, FRG, EARN: G11H11, DM0TUI1S, Germany"],"affiliations":[{"raw_affiliation_string":"Institut für Informatik, Technische Universität München, FRG, EARN: G11H11, DM0TUI1S, Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5061806234"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.6821,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.97688093,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"120","last_page":"129"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998999834060669,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998999834060669,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9976999759674072,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9945999979972839,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/fixed-point","display_name":"Fixed point","score":0.7425825595855713},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7170875072479248},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.6516517400741577},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.5947831869125366},{"id":"https://openalex.org/keywords/forward-chaining","display_name":"Forward chaining","score":0.47283443808555603},{"id":"https://openalex.org/keywords/semaphore","display_name":"Semaphore","score":0.44606131315231323},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.43740102648735046},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.4173371195793152},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4058071970939636},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39441436529159546},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.37487518787384033},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25627830624580383},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.19482427835464478}],"concepts":[{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.7425825595855713},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7170875072479248},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.6516517400741577},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.5947831869125366},{"id":"https://openalex.org/C142614401","wikidata":"https://www.wikidata.org/wiki/Q777433","display_name":"Forward chaining","level":3,"score":0.47283443808555603},{"id":"https://openalex.org/C95203288","wikidata":"https://www.wikidata.org/wiki/Q221682","display_name":"Semaphore","level":2,"score":0.44606131315231323},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.43740102648735046},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.4173371195793152},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4058071970939636},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39441436529159546},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.37487518787384033},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25627830624580383},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.19482427835464478},{"id":"https://openalex.org/C58328972","wikidata":"https://www.wikidata.org/wiki/Q184609","display_name":"Expert system","level":2,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/icde.1987.7272365","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.1987.7272365","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"1987 IEEE Third International Conference on Data Engineering","raw_type":"proceedings-article"},{"id":"pmh:oai:aleph.bib-bvb.de:BVB01-006152479","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:uni-augsburg.opus-bayern.de:61578","is_oa":false,"landing_page_url":"https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/61578","pdf_url":null,"source":{"id":"https://openalex.org/S4306400930","display_name":"OPUS (Augsburg University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I119916105","host_organization_name":"Augsburg University","host_organization_lineage":["https://openalex.org/I119916105"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"bookpart"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W196018858"],"related_works":["https://openalex.org/W2200927817","https://openalex.org/W3004427400","https://openalex.org/W1981108036","https://openalex.org/W2091489058","https://openalex.org/W2001237670","https://openalex.org/W2365256108","https://openalex.org/W1595611771","https://openalex.org/W2056486266","https://openalex.org/W2268677203","https://openalex.org/W2089352481"],"abstract_inverted_index":{"Based":[0],"on":[1],"matured":[2],"database":[3,101],"technology":[4,102],"the":[5,21,37,53,56,72,111,125],"paper":[6],"provides":[7],"new":[8],"insights":[9],"into":[10],"efficient":[11],"ways":[12],"to":[13,24,108],"evaluate":[14],"recursive":[15],"deduction":[16,25],"rules.":[17],"We":[18],"show":[19],"how":[20],"forward-chaining":[22],"approach":[23],"can":[26],"flexibly":[27],"be":[28],"married":[29],"with":[30,79],"goal-directed":[31],"aspects":[32],"of":[33,41,64,67,100,114,127],"best/easiest-first":[34],"strategies.":[35],"From":[36],"natural":[38],"fixpoint":[39,81],"semantics":[40],"recursion":[42],"we":[43,106],"develop":[44],"generally":[45],"applicable":[46],"differential":[47],"iteration":[48],"schemes":[49],"that":[50],"efficiently":[51],"compute":[52],"fixpoint.":[54],"Surprisingly":[55],"well-known":[57],"Warshall-algorithm":[58],"gets":[59],"disclosed":[60],"as":[61,74,76,83],"a":[62,87,94],"descendant":[63],"this":[65],"class":[66],"algorithms.":[68],"Performance":[69],"measurements":[70],"suggest":[71,107],"former":[73],"well":[75],"systolic":[77],"\u0394-algorithms":[78],"linear":[80],"equation":[82],"candidates":[84],"for":[85,124],"incorporating":[86],"transitive":[88],"closure":[89],"operator":[90],"in":[91],"databases.":[92],"As":[93],"next":[95],"important":[96],"step":[97],"towards":[98],"integration":[99],"and":[103,117],"logic":[104],"programming":[105],"profit":[109],"from":[110],"standard":[112],"features":[113],"concurrency":[115],"control":[116],"transaction":[118],"management":[119],"by":[120],"effectively":[121],"using":[122],"them":[123],"synchronization":[126],"parallel":[128],"deductions.":[129]},"counts_by_year":[{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}