{"id":"https://openalex.org/W2091652888","doi":"https://doi.org/10.1017/s1471068412000178","title":"Efficient tabling of structured data with enhanced hash-consing","display_name":"Efficient tabling of structured data with enhanced hash-consing","publication_year":2012,"publication_date":"2012-07-01","ids":{"openalex":"https://openalex.org/W2091652888","doi":"https://doi.org/10.1017/s1471068412000178","mag":"2091652888"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068412000178","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068412000178","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-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/A5113864016","display_name":"Neng\u2010Fa Zhou","orcid":null},"institutions":[{"id":"https://openalex.org/I121847817","display_name":"The Graduate Center, CUNY","ror":"https://ror.org/00awd9g61","country_code":"US","type":"education","lineage":["https://openalex.org/I121847817"]},{"id":"https://openalex.org/I83041322","display_name":"Brooklyn College","ror":"https://ror.org/019k4jq75","country_code":"US","type":"education","lineage":["https://openalex.org/I83041322"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"NENG-FA ZHOU","raw_affiliation_strings":["CUNY Brooklyn College & Graduate Center (e-mail:","Cuny brooklyn college & graduate center (e-mail: [email\u00a0protected])#TAB#"],"affiliations":[{"raw_affiliation_string":"CUNY Brooklyn College & Graduate Center (e-mail:","institution_ids":["https://openalex.org/I83041322","https://openalex.org/I121847817"]},{"raw_affiliation_string":"Cuny brooklyn college & graduate center (e-mail: [email\u00a0protected])#TAB#","institution_ids":["https://openalex.org/I83041322"]}]},{"author_position":"last","author":{"id":null,"display_name":"CHRISTIAN THEIL HAVE","orcid":null},"institutions":[{"id":"https://openalex.org/I107707843","display_name":"Roskilde University","ror":"https://ror.org/014axpa37","country_code":"DK","type":"education","lineage":["https://openalex.org/I107707843"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"CHRISTIAN THEIL HAVE","raw_affiliation_strings":["Roskilde University (e-mail:","Roskilde university (e-mail: [email\u00a0protected])#TAB#"],"affiliations":[{"raw_affiliation_string":"Roskilde University (e-mail:","institution_ids":["https://openalex.org/I107707843"]},{"raw_affiliation_string":"Roskilde university (e-mail: [email\u00a0protected])#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5113864016"],"corresponding_institution_ids":["https://openalex.org/I121847817","https://openalex.org/I83041322"],"apc_list":null,"apc_paid":null,"fwci":3.9796,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.93780576,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"12","issue":"4-5","first_page":"547","last_page":"563"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.998199999332428,"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/T11269","display_name":"Algorithms and Data Compression","score":0.998199999332428,"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.996999979019165,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.991599977016449,"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/computer-science","display_name":"Computer science","score":0.9052640199661255},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.68406742811203},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.5581790804862976},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4750801920890808}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9052640199661255},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.68406742811203},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.5581790804862976},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4750801920890808}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s1471068412000178","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068412000178","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/f3c8a137-d7d2-4809-ae8b-ee37b95f4002","is_oa":false,"landing_page_url":"https://forskning.ruc.dk/da/publications/f3c8a137-d7d2-4809-ae8b-ee37b95f4002","pdf_url":null,"source":{"id":"https://openalex.org/S4306401457","display_name":"RUCforsk (Roskilde University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I107707843","host_organization_name":"Roskilde University","host_organization_lineage":["https://openalex.org/I107707843"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.7900000214576721}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W120629208","https://openalex.org/W1574950491","https://openalex.org/W1965784613","https://openalex.org/W1984187667","https://openalex.org/W2008913431","https://openalex.org/W2070598037","https://openalex.org/W2091478774","https://openalex.org/W2100145144","https://openalex.org/W2151120711","https://openalex.org/W2165876990","https://openalex.org/W2166617161","https://openalex.org/W2170948668","https://openalex.org/W2278485102","https://openalex.org/W2963711700","https://openalex.org/W6650542787","https://openalex.org/W6682616907","https://openalex.org/W6684129671"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2144265691","https://openalex.org/W1605991620","https://openalex.org/W113683524","https://openalex.org/W4385261619","https://openalex.org/W93624718"],"abstract_inverted_index":{"Abstract":[0],"Current":[1],"tabling":[2,74],"systems":[3,58],"suffer":[4],"from":[5,39],"an":[6],"increase":[7],"in":[8,48,77,135],"space":[9,84],"complexity,":[10],"time":[11,95,114],"complexity":[12,115],"or":[13],"both":[14],"when":[15,86],"dealing":[16],"with":[17,100,161],"sequences":[18],"due":[19],"to":[20,34,73,129],"the":[21,32,40,83,94,113,131,136,145],"use":[22,60],"of":[23,147],"data":[24,76],"structures":[25],"for":[26,111,121,139],"tabled":[27],"subgoals":[28],"and":[29,31,38,65,106,153],"answers":[30],"need":[33],"copy":[35],"terms":[36],"into":[37],"table":[41],"area.":[42],"This":[43],"symptom":[44],"can":[45,81],"be":[46],"seen":[47],"not":[49,92],"only":[50],"B-Prolog,":[51],"which":[52],"uses":[53],"hash":[54,107,119],"tables,":[55],"but":[56],"also":[57],"that":[59],"tries":[61],"such":[62,149],"as":[63,150],"XSB":[64],"YAP.":[66],"In":[67],"this":[68,159],"paper,":[69],"we":[70],"apply":[71],"hash-consing":[72,80,99],"structured":[75],"B-Prolog.":[78],"While":[79],"reduce":[82],"consumption":[85],"sharing":[87,105],"is":[88,127],"effective,":[89],"it":[90],"does":[91],"change":[93],"complexity.":[96],"We":[97,157],"enhance":[98],"two":[101],"techniques,":[102],"called":[103],"input":[104],"code":[108],"memoization":[109],",":[110],"reducing":[112],"by":[116],"avoiding":[117],"computing":[118],"codes":[120],"certain":[122],"terms.":[123],"The":[124],"improved":[125],"system":[126,138],"able":[128],"eliminate":[130],"extra":[132],"linear":[133],"factor":[134],"old":[137],"processing":[140],"sequences,":[141],"thus":[142],"significantly":[143],"enhancing":[144],"scalability":[146],"applications":[148],"language":[151],"parsing":[152],"bio-sequence":[154],"analysis":[155],"applications.":[156],"confirm":[158],"improvement":[160],"experimental":[162],"results.":[163]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}