{"id":"https://openalex.org/W2113304268","doi":"https://doi.org/10.1109/dasfaa.2003.1192391","title":"Indexing high-dimensional data for content-based retrieval in large databases","display_name":"Indexing high-dimensional data for content-based retrieval in large databases","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2113304268","doi":"https://doi.org/10.1109/dasfaa.2003.1192391","mag":"2113304268"},"language":"en","primary_location":{"id":"doi:10.1109/dasfaa.2003.1192391","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dasfaa.2003.1192391","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Eighth International Conference on Database Systems for Advanced Applications, 2003. (DASFAA 2003). Proceedings.","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/A5017651127","display_name":"Manuel J. Fonseca","orcid":"https://orcid.org/0000-0002-3559-828X"},"institutions":[{"id":"https://openalex.org/I141596103","display_name":"University of Lisbon","ror":"https://ror.org/01c27hj86","country_code":"PT","type":"education","lineage":["https://openalex.org/I141596103"]},{"id":"https://openalex.org/I121345201","display_name":"Instituto de Engenharia de Sistemas e Computadores Investiga\u00e7\u00e3o e Desenvolvimento","ror":"https://ror.org/04mqy3p58","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I121345201","https://openalex.org/I4210125590"]}],"countries":["PT"],"is_corresponding":true,"raw_author_name":"M.J. Fonseca","raw_affiliation_strings":["Department of Information Systems and Computer Sciences, Technical University of Lisbon, INESC-ID/IST, Lisboa, Portugal","Dept. of Inf. Syst. & Comput. Sci., Tech. Univ. Lisbon, Portugal"],"affiliations":[{"raw_affiliation_string":"Department of Information Systems and Computer Sciences, Technical University of Lisbon, INESC-ID/IST, Lisboa, Portugal","institution_ids":["https://openalex.org/I121345201","https://openalex.org/I141596103"]},{"raw_affiliation_string":"Dept. of Inf. Syst. & Comput. Sci., Tech. Univ. Lisbon, Portugal","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059140450","display_name":"Joaquim Jorge","orcid":"https://orcid.org/0000-0001-5441-4637"},"institutions":[{"id":"https://openalex.org/I121345201","display_name":"Instituto de Engenharia de Sistemas e Computadores Investiga\u00e7\u00e3o e Desenvolvimento","ror":"https://ror.org/04mqy3p58","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I121345201","https://openalex.org/I4210125590"]},{"id":"https://openalex.org/I141596103","display_name":"University of Lisbon","ror":"https://ror.org/01c27hj86","country_code":"PT","type":"education","lineage":["https://openalex.org/I141596103"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"J.A. Jorge","raw_affiliation_strings":["Department of Information Systems and Computer Sciences, Technical University of Lisbon, INESC-ID/IST, Lisboa, Portugal","Dept. of Inf. Syst. & Comput. Sci., Tech. Univ. Lisbon, Portugal"],"affiliations":[{"raw_affiliation_string":"Department of Information Systems and Computer Sciences, Technical University of Lisbon, INESC-ID/IST, Lisboa, Portugal","institution_ids":["https://openalex.org/I121345201","https://openalex.org/I141596103"]},{"raw_affiliation_string":"Dept. of Inf. Syst. & Comput. Sci., Tech. Univ. Lisbon, Portugal","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5017651127"],"corresponding_institution_ids":["https://openalex.org/I121345201","https://openalex.org/I141596103"],"apc_list":null,"apc_paid":null,"fwci":4.4458,"has_fulltext":false,"cited_by_count":62,"citation_normalized_percentile":{"value":0.95326046,"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":"267","last_page":"274"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":1.0,"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":1.0,"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/T11439","display_name":"Video Analysis and Summarization","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/search-engine-indexing","display_name":"Search engine indexing","score":0.792983889579773},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7692148685455322},{"id":"https://openalex.org/keywords/range-query","display_name":"Range query (database)","score":0.604851245880127},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.5778699517250061},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.5146899819374084},{"id":"https://openalex.org/keywords/intrinsic-dimension","display_name":"Intrinsic dimension","score":0.5096225738525391},{"id":"https://openalex.org/keywords/cover-tree","display_name":"Cover tree","score":0.49417856335639954},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4931430220603943},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.47085946798324585},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4600384831428528},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4595017433166504},{"id":"https://openalex.org/keywords/dimensionality-reduction","display_name":"Dimensionality reduction","score":0.4446839392185211},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.43939024209976196},{"id":"https://openalex.org/keywords/database-index","display_name":"Database index","score":0.4374580681324005},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.41835111379623413},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.2757999002933502},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1844203770160675},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14720213413238525},{"id":"https://openalex.org/keywords/web-search-query","display_name":"Web search query","score":0.12611845135688782},{"id":"https://openalex.org/keywords/search-engine","display_name":"Search engine","score":0.11822003126144409}],"concepts":[{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.792983889579773},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7692148685455322},{"id":"https://openalex.org/C136736807","wikidata":"https://www.wikidata.org/wiki/Q818943","display_name":"Range query (database)","level":5,"score":0.604851245880127},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.5778699517250061},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.5146899819374084},{"id":"https://openalex.org/C30732413","wikidata":"https://www.wikidata.org/wiki/Q17092636","display_name":"Intrinsic dimension","level":3,"score":0.5096225738525391},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.49417856335639954},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4931430220603943},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.47085946798324585},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4600384831428528},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4595017433166504},{"id":"https://openalex.org/C70518039","wikidata":"https://www.wikidata.org/wiki/Q16000077","display_name":"Dimensionality reduction","level":2,"score":0.4446839392185211},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.43939024209976196},{"id":"https://openalex.org/C59276292","wikidata":"https://www.wikidata.org/wiki/Q580427","display_name":"Database index","level":3,"score":0.4374580681324005},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.41835111379623413},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.2757999002933502},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1844203770160675},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14720213413238525},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.12611845135688782},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.11822003126144409},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C192939062","wikidata":"https://www.wikidata.org/wiki/Q104840822","display_name":"Sargable","level":4,"score":0.0},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/dasfaa.2003.1192391","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dasfaa.2003.1192391","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Eighth International Conference on Database Systems for Advanced Applications, 2003. (DASFAA 2003). Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.331.6218","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.331.6218","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://automatix.inesc.pt/virtual/tr/mjf-jaj-TR-01-03.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.8.9051","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.9051","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://immi.inesc.pt/~mjf/publications/dasfaa03.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1541459201","https://openalex.org/W1770616178","https://openalex.org/W1978447605","https://openalex.org/W2000830496","https://openalex.org/W2006611575","https://openalex.org/W2011027271","https://openalex.org/W2073796020","https://openalex.org/W2080115635","https://openalex.org/W2097042476","https://openalex.org/W2105022522","https://openalex.org/W2106626784","https://openalex.org/W2108908993","https://openalex.org/W2110867479","https://openalex.org/W2113304268","https://openalex.org/W2133542527","https://openalex.org/W2145725688","https://openalex.org/W2155354516","https://openalex.org/W2155776210","https://openalex.org/W2238624099","https://openalex.org/W6632397832","https://openalex.org/W6675816764","https://openalex.org/W7062905887"],"related_works":["https://openalex.org/W1768130544","https://openalex.org/W2115372571","https://openalex.org/W2982637876","https://openalex.org/W2031043614","https://openalex.org/W1518365703","https://openalex.org/W2357477326","https://openalex.org/W2070705506","https://openalex.org/W2090714989","https://openalex.org/W2113304268","https://openalex.org/W3014326119"],"abstract_inverted_index":{"Many":[0],"indexing":[1,42,56],"approaches":[2,40],"for":[3,58,164],"high-dimensional":[4,59],"data":[5,60,89,138,166,180],"points":[6,72],"have":[7],"evolved":[8],"into":[9],"very":[10],"complex":[11],"and":[12,36,82,108,124,131,141,161,179,187],"hard":[13],"to":[14,41,73,87,98,104,172],"code":[15],"algorithms.":[16],"Sometimes":[17],"this":[18,46],"complexity":[19],"is":[20],"not":[21],"matched":[22],"by":[23,28,77],"increase":[24],"in":[25],"performance.":[26],"Motivated":[27],"these":[29],"ideas,":[30],"we":[31,48,115],"take":[32],"a":[33,50,74,84,117,135],"step":[34],"back":[35],"look":[37],"at":[38],"simpler":[39],"multimedia":[43],"data.":[44,126],"In":[45],"paper":[47],"propose":[49],"simple,":[51,100],"(not":[52],"simplistic)":[53],"yet":[54,101],"efficient":[55,95],"structure":[57],"Points":[61],"of":[62,119,137],"variable":[63],"dimension,":[64],"using":[65,121],"dimension":[66],"reduction.":[67],"Our":[68],"approach":[69,170],"maps":[70],"multidimensional":[71],"1D":[75],"line":[76],"computing":[78],"their":[79],"Euclidean":[80],"Norm":[81],"use":[83],"B/sup":[85,93],"+/-Tree":[86,94],"store":[88],"points.":[90],"We":[91,127],"exploit":[92],"sequential":[96],"search":[97,188],"develop":[99],"performant":[102],"methods":[103],"implement":[105],"point,":[106],"range":[107],"nearest-neighbor":[109],"queries.":[110],"To":[111],"evaluate":[112],"our":[113,148,169],"technique":[114],"conducted":[116],"set":[118,139,181],"experiments,":[120],"both":[122,175],"synthetic":[123],"real":[125],"analyze":[128],"creation,":[129],"insertion":[130,186],"query":[132],"times":[133],"as":[134,155],"function":[136],"size":[140],"dimension.":[142],"Results":[143],"so":[144],"far":[145],"show":[146],"that":[147],"simple":[149],"scheme":[150],"outperforms":[151],"current":[152],"approaches,":[153],"such":[154],"the":[156,159,162],"Pyramid":[157],"Technique,":[158],"A-Tree":[160],"SR-Tree,":[163],"many":[165],"distributions.":[167],"Moreover,":[168],"seems":[171],"scale":[173],"better":[174],"with":[176],"growing":[177],"dimensionality":[178],"size,":[182],"while":[183],"exhibiting":[184],"low":[185],"times.":[189]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":7}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}