{"id":"https://openalex.org/W2048852245","doi":"https://doi.org/10.1017/s1471068413000501","title":"BigYAP: Exo-compilation meets UDI","display_name":"BigYAP: Exo-compilation meets UDI","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W2048852245","doi":"https://doi.org/10.1017/s1471068413000501","mag":"2048852245"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068413000501","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068413000501","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":true,"oa_status":"green","oa_url":"http://repositorio.inesctec.pt/handle/123456789/7030","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059093687","display_name":"V\u0131\u0301tor Santos Costa","orcid":"https://orcid.org/0000-0002-3344-8237"},"institutions":[{"id":"https://openalex.org/I182534213","display_name":"Universidade do Porto","ror":"https://ror.org/043pwc612","country_code":"PT","type":"education","lineage":["https://openalex.org/I182534213"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"V\u00cdTOR SANTOS COSTA","raw_affiliation_strings":["CRACS - DCC/FCUP, University of Porto, Portugal","University of Porto"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CRACS - DCC/FCUP, University of Porto, Portugal","institution_ids":["https://openalex.org/I182534213"]},{"raw_affiliation_string":"University of Porto","institution_ids":["https://openalex.org/I182534213"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012470372","display_name":"David Vaz","orcid":null},"institutions":[{"id":"https://openalex.org/I182534213","display_name":"Universidade do Porto","ror":"https://ror.org/043pwc612","country_code":"PT","type":"education","lineage":["https://openalex.org/I182534213"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"DAVID VAZ","raw_affiliation_strings":["CRACS - DCC/FCUP, University of Porto, Portugal","University of Porto"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CRACS - DCC/FCUP, University of Porto, Portugal","institution_ids":["https://openalex.org/I182534213"]},{"raw_affiliation_string":"University of Porto","institution_ids":["https://openalex.org/I182534213"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I182534213"],"apc_list":null,"apc_paid":null,"fwci":0.3174,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.57727353,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"13","issue":"4-5","first_page":"799","last_page":"813"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"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.9997000098228455,"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.9994999766349792,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9973999857902527,"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.9068596363067627},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.8950437903404236},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.6301451921463013},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.49232017993927},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4804401099681854},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.44415318965911865},{"id":"https://openalex.org/keywords/memory-footprint","display_name":"Memory footprint","score":0.4405588209629059},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3273777961730957},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.2803398072719574}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9068596363067627},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.8950437903404236},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.6301451921463013},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.49232017993927},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4804401099681854},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.44415318965911865},{"id":"https://openalex.org/C74912251","wikidata":"https://www.wikidata.org/wiki/Q6815727","display_name":"Memory footprint","level":2,"score":0.4405588209629059},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3273777961730957},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.2803398072719574}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s1471068413000501","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068413000501","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:repositorio.inesctec.pt:123456789/7030","is_oa":true,"landing_page_url":"http://repositorio.inesctec.pt/handle/123456789/7030","pdf_url":null,"source":{"id":"https://openalex.org/S4306402433","display_name":"Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"journal article"}],"best_oa_location":{"id":"pmh:oai:repositorio.inesctec.pt:123456789/7030","is_oa":true,"landing_page_url":"http://repositorio.inesctec.pt/handle/123456789/7030","pdf_url":null,"source":{"id":"https://openalex.org/S4306402433","display_name":"Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"journal article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W160457788","https://openalex.org/W175430435","https://openalex.org/W201914809","https://openalex.org/W855046723","https://openalex.org/W1515187406","https://openalex.org/W1547998134","https://openalex.org/W1567678041","https://openalex.org/W1570041031","https://openalex.org/W1579914521","https://openalex.org/W1980108527","https://openalex.org/W1984187667","https://openalex.org/W2082232766","https://openalex.org/W2091652888","https://openalex.org/W2103017472","https://openalex.org/W2154267842","https://openalex.org/W2155247860","https://openalex.org/W2165467455","https://openalex.org/W2165876990","https://openalex.org/W2185907055","https://openalex.org/W2523003410","https://openalex.org/W2911601159","https://openalex.org/W2912463049","https://openalex.org/W2912613826","https://openalex.org/W2913295241","https://openalex.org/W4251197763","https://openalex.org/W6673634267","https://openalex.org/W6684129671","https://openalex.org/W6758652798","https://openalex.org/W6832170654"],"related_works":["https://openalex.org/W1579914521","https://openalex.org/W1999702466","https://openalex.org/W1602023752","https://openalex.org/W1481700938","https://openalex.org/W2741053223","https://openalex.org/W1493824320","https://openalex.org/W592311106","https://openalex.org/W4319165641","https://openalex.org/W2972366161","https://openalex.org/W4380901377"],"abstract_inverted_index":{"Abstract":[0],"The":[1,183],"widespread":[2],"availability":[3],"of":[4,77,80,142,148,168],"large":[5,68,107],"data-sets":[6,69],"poses":[7],"both":[8,74,139],"an":[9,71],"opportunity":[10],"and":[11,79,94,145,190,205],"a":[12,23,30,110],"challenge":[13],"to":[14,21,54,65,104,179],"logic":[15,27],"programming.":[16],"A":[17],"first":[18],"approach":[19,37],"is":[20,52,109,155,160],"couple":[22],"relational":[24],"database":[25],"with":[26,33,67,106,130,195,203],"programming,":[28],"say,":[29],"Prolog":[31,63],"system":[32,64],"MySQL.":[34],"While":[35],"this":[36,92],"does":[38],"pay":[39],"off":[40],"in":[41,48,70,75,99,140,146],"cases":[42],"where":[43],"the":[44,62,119,166,175,209],"data":[45],"cannot":[46],"reside":[47],"main":[49],"memory,":[50],"it":[51],"known":[53],"introduce":[55],"substantial":[56],"overheads.":[57],"Ideally,":[58],"we":[59],"would":[60],"like":[61],"deal":[66,105],"efficient":[72],"way":[73],"terms":[76,141,147],"memory":[78,120,143],"processing":[81],"time.":[82,150],"Just":[83,131],"In":[84,132],"Time":[85,133],"Indexing":[86,134,162],"(JITI)":[87],"was":[88],"mainly":[89],"motivated":[90],"by":[91,200],"challenge,":[93],"can":[95,135,191],"work":[96],"quite":[97],"well":[98],"many":[100,158],"application.":[101],"Exo-compilation,":[102],"designed":[103],"tables,":[108],"next":[111],"step":[112],"that":[113,127,154],"achieves":[114],"very":[115],"interesting":[116],"results,":[117],"reducing":[118],"footprint":[121],"over":[122],"two":[123],"thirds.":[124],"We":[125,197],"show":[126],"combining":[128],"exo-compilation":[129],"have":[136],"significant":[137],"advantages":[138],"usage":[144],"execution":[149],"An":[151],"alternative":[152],"path":[153],"relevant":[156],"for":[157,171,214],"applications":[159],"User-Defined":[161],"(UDI).":[163],"This":[164],"allows":[165],"use":[167],"specialized":[169],"indexing":[170,177,186],"specific":[172,215],"applications,":[173],"say":[174],"spatial":[176,181],"crucial":[178],"any":[180],"system.":[182],"UDI":[184,202,210],"sees":[185],"as":[187],"pluggable":[188],"modules,":[189],"naturally":[192],"be":[193],"combined":[194],"Exo-compilation.":[196],"do":[198],"so":[199],"using":[201],"exo-data,":[204],"incorporating":[206],"ideas":[207],"from":[208],"into":[211],"high-performance":[212],"indexers":[213],"tasks.":[216]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}