{"id":"https://openalex.org/W2106626784","doi":"https://doi.org/10.1109/icde.1999.754960","title":"The hybrid tree: an index structure for high dimensional feature spaces","display_name":"The hybrid tree: an index structure for high dimensional feature spaces","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2106626784","doi":"https://doi.org/10.1109/icde.1999.754960","mag":"2106626784"},"language":"en","primary_location":{"id":"doi:10.1109/icde.1999.754960","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.1999.754960","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)","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/A5113509258","display_name":"Kaushik Chakrabarti","orcid":null},"institutions":[{"id":"https://openalex.org/I183874917","display_name":"Urbana University","ror":"https://ror.org/04kp3hw27","country_code":"US","type":"education","lineage":["https://openalex.org/I183874917"]},{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"K. Chakrabarti","raw_affiliation_strings":["Department of Computer Science, University of Illinois, Urbana-Champaign, USA","Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois, Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA","institution_ids":["https://openalex.org/I183874917"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010114060","display_name":"Sharad Mehrotra","orcid":"https://orcid.org/0000-0003-1667-5435"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Mehrotra","raw_affiliation_strings":["Department of Information and Computer Science, University of California, Irvine, USA","Department of Information and Computer Science, University of California Irvine, USA"],"affiliations":[{"raw_affiliation_string":"Department of Information and Computer Science, University of California, Irvine, USA","institution_ids":["https://openalex.org/I204250578"]},{"raw_affiliation_string":"Department of Information and Computer Science, University of California Irvine, USA","institution_ids":["https://openalex.org/I204250578"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5113509258"],"corresponding_institution_ids":["https://openalex.org/I157725225","https://openalex.org/I183874917"],"apc_list":null,"apc_paid":null,"fwci":11.2381,"has_fulltext":false,"cited_by_count":207,"citation_normalized_percentile":{"value":0.98913043,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"440","last_page":"447"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9889000058174133,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.983299970626831,"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.739568829536438},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6340628266334534},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.6182518601417542},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6165961027145386},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5990689992904663},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.5547738671302795},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5289167165756226},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5109185576438904},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.5091792941093445},{"id":"https://openalex.org/keywords/feature-vector","display_name":"Feature vector","score":0.4893273711204529},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.48901304602622986},{"id":"https://openalex.org/keywords/range-query","display_name":"Range query (database)","score":0.4795491397380829},{"id":"https://openalex.org/keywords/database-index","display_name":"Database index","score":0.47842341661453247},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.4769388735294342},{"id":"https://openalex.org/keywords/b-tree","display_name":"B-tree","score":0.47693198919296265},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.45223116874694824},{"id":"https://openalex.org/keywords/r-tree","display_name":"R-tree","score":0.428046852350235},{"id":"https://openalex.org/keywords/space-partitioning","display_name":"Space partitioning","score":0.41252484917640686},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32972633838653564},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2874024510383606},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2556043267250061},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.1763908565044403},{"id":"https://openalex.org/keywords/spatial-database","display_name":"Spatial database","score":0.1560845673084259},{"id":"https://openalex.org/keywords/search-engine","display_name":"Search engine","score":0.09942740201950073},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.07801783084869385},{"id":"https://openalex.org/keywords/spatial-analysis","display_name":"Spatial analysis","score":0.07330101728439331},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07104715704917908}],"concepts":[{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.739568829536438},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6340628266334534},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.6182518601417542},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6165961027145386},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5990689992904663},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.5547738671302795},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5289167165756226},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5109185576438904},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.5091792941093445},{"id":"https://openalex.org/C83665646","wikidata":"https://www.wikidata.org/wiki/Q42139305","display_name":"Feature vector","level":2,"score":0.4893273711204529},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.48901304602622986},{"id":"https://openalex.org/C136736807","wikidata":"https://www.wikidata.org/wiki/Q818943","display_name":"Range query (database)","level":5,"score":0.4795491397380829},{"id":"https://openalex.org/C59276292","wikidata":"https://www.wikidata.org/wiki/Q580427","display_name":"Database index","level":3,"score":0.47842341661453247},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.4769388735294342},{"id":"https://openalex.org/C78669399","wikidata":"https://www.wikidata.org/wiki/Q677051","display_name":"B-tree","level":3,"score":0.47693198919296265},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.45223116874694824},{"id":"https://openalex.org/C106278948","wikidata":"https://www.wikidata.org/wiki/Q1198051","display_name":"R-tree","level":4,"score":0.428046852350235},{"id":"https://openalex.org/C13670688","wikidata":"https://www.wikidata.org/wiki/Q3500548","display_name":"Space partitioning","level":2,"score":0.41252484917640686},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32972633838653564},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2874024510383606},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2556043267250061},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.1763908565044403},{"id":"https://openalex.org/C203689450","wikidata":"https://www.wikidata.org/wiki/Q2302053","display_name":"Spatial database","level":3,"score":0.1560845673084259},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.09942740201950073},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.07801783084869385},{"id":"https://openalex.org/C159620131","wikidata":"https://www.wikidata.org/wiki/Q1938983","display_name":"Spatial analysis","level":2,"score":0.07330101728439331},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07104715704917908},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C192939062","wikidata":"https://www.wikidata.org/wiki/Q104840822","display_name":"Sargable","level":4,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/icde.1999.754960","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.1999.754960","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.218.9822","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.9822","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ics.uci.edu/~cs222/handouts/chakrabarti99hybrid.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.33.2333","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.2333","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ics.uci.edu/~kaushik/research/desc/papers/htree.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.36.4984","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.4984","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-db.ics.uci.edu/pages/publications/1999/tr-db-99-01.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.44.7959","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.7959","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-db.ics.uci.edu/pages/publications/1999/TR-MARS-99-01.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1509426348","https://openalex.org/W1515987617","https://openalex.org/W1541459201","https://openalex.org/W1607838481","https://openalex.org/W1654865708","https://openalex.org/W1672197616","https://openalex.org/W1770616178","https://openalex.org/W1971927246","https://openalex.org/W1978414048","https://openalex.org/W1978447605","https://openalex.org/W2000830496","https://openalex.org/W2066799613","https://openalex.org/W2104128006","https://openalex.org/W2108908993","https://openalex.org/W2118269922","https://openalex.org/W2125336854","https://openalex.org/W2129978134","https://openalex.org/W2133542527","https://openalex.org/W2145725688","https://openalex.org/W2149173084","https://openalex.org/W2155776210","https://openalex.org/W2157092487","https://openalex.org/W2162362064","https://openalex.org/W2238624099","https://openalex.org/W4243869499","https://openalex.org/W6630456963","https://openalex.org/W6632397832","https://openalex.org/W6636174612","https://openalex.org/W6636955212","https://openalex.org/W6682969285","https://openalex.org/W7062905887"],"related_works":["https://openalex.org/W131606651","https://openalex.org/W2111025582","https://openalex.org/W1555625619","https://openalex.org/W2891890851","https://openalex.org/W2383581812","https://openalex.org/W3193719172","https://openalex.org/W2166057496","https://openalex.org/W4238966273","https://openalex.org/W2168653783","https://openalex.org/W2555447445"],"abstract_inverted_index":{"Feature-based":[0],"similarity":[1],"searching":[2,38],"is":[3,16,30,62,148],"emerging":[4],"as":[5,22,95,105,119,217,219],"an":[6],"important":[7],"search":[8,44,145],"paradigm":[9],"in":[10],"database":[11,205],"systems.":[12],"The":[13],"technique":[14],"used":[15],"to":[17,41,64,142,151,200],"map":[18],"the":[19,46,73,89,106,120,127,131,157,170,174,195],"data":[20,35,47,51,77,87,99,140,163],"items":[21],"points":[23],"into":[24,137],"a":[25,33,42,97,112,138,144],"high-dimensional":[26,81,189],"feature":[27,57,82,191],"space":[28,114],"which":[29,147],"indexed":[31],"using":[32],"multidimensional":[34,76,86],"structure.":[36,48],"Similarity":[37],"then":[39],"corresponds":[40],"range":[43],"over":[45],"Although":[49],"several":[50],"structures":[52,136,164,168],"have":[53],"been":[54],"proposed":[55],"for":[56,79,225],"indexing,":[58],"none":[59],"of":[60,130,134,156],"them":[61],"known":[63],"scale":[65],"beyond":[66],"10-15":[67],"dimensional":[68],"spaces.":[69,83],"This":[70],"paper":[71],"introduces":[72],"hybrid":[74,90,175,196],"tree-a":[75],"structure":[78,103,141],"indexing":[80],"Unlike":[84],"other":[85],"structures,":[88],"tree":[91,176,197],"cannot":[92],"be":[93],"classified":[94],"either":[96,155],"pure":[98,113],"partitioning":[100,115],"(DP)":[101],"index":[102,135,167,215],"(such":[104,118],"R-tree,":[107],"SS-tree":[108,171],"or":[109,111,122],"SR-tree)":[110],"(SP)":[116],"one":[117],"KDB-tree":[121],"hB-tree);":[123],"rather":[124],"it":[125],"combines":[126],"positive":[128],"aspects":[129],"two":[132],"types":[133],"single":[139],"achieve":[143],"performance":[146],"more":[149],"scalable":[150],"high":[152,201],"dimensionalities":[153,224],"than":[154],"above":[158],"techniques.":[159],"Furthermore,":[160],"unlike":[161],"many":[162],"(e.g.":[165],"distance-based":[166],"like":[169],"and":[172,203,213],"SR-tree),":[173],"can":[177],"support":[178],"queries":[179],"based":[180],"on":[181,187],"arbitrary":[182],"distance":[183],"functions.":[184],"Our":[185],"experiments":[186],"\"real\"":[188],"large-size":[190],"databases":[192],"demonstrate":[193],"that":[194],"scales":[198],"well":[199,218],"dimensionality":[202],"large":[204],"sizes.":[206],"It":[207],"significantly":[208],"outperforms":[209],"both":[210],"purely":[211],"DP-based":[212],"SP-based":[214],"mechanisms":[216],"linear":[220],"scans":[221],"at":[222],"all":[223],"large-sized":[226],"databases.":[227]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}