{"id":"https://openalex.org/W2808947534","doi":"https://doi.org/10.1145/3201463.3201466","title":"Processing Class-Constraint K-NN Queries with MISP","display_name":"Processing Class-Constraint K-NN Queries with MISP","publication_year":2018,"publication_date":"2018-06-10","ids":{"openalex":"https://openalex.org/W2808947534","doi":"https://doi.org/10.1145/3201463.3201466","mag":"2808947534"},"language":"en","primary_location":{"id":"doi:10.1145/3201463.3201466","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3201463.3201466","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 21st International Workshop on the Web and Databases","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/A5003112757","display_name":"Evica Milchevski","orcid":null},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Evica Milchevski","raw_affiliation_strings":["TU Kaiserslautern, Kaiserslautern, Germany"],"affiliations":[{"raw_affiliation_string":"TU Kaiserslautern, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016501621","display_name":"Fabian Neffgen","orcid":null},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Fabian Neffgen","raw_affiliation_strings":["TU Kaiserslautern, Kaiserslautern, Germany"],"affiliations":[{"raw_affiliation_string":"TU Kaiserslautern, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043223305","display_name":"Sebastian Michel","orcid":"https://orcid.org/0000-0001-6636-2694"},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sebastian Michel","raw_affiliation_strings":["TU Kaiserslautern, Kaiserslautern, Germany"],"affiliations":[{"raw_affiliation_string":"TU Kaiserslautern, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5003112757"],"corresponding_institution_ids":["https://openalex.org/I153267046"],"apc_list":null,"apc_paid":null,"fwci":0.1651,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.42763376,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9927999973297119,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9860000014305115,"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/pruning","display_name":"Pruning","score":0.816993236541748},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.7468396425247192},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.678764820098877},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5914897918701172},{"id":"https://openalex.org/keywords/index","display_name":"Index (typography)","score":0.58901447057724},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5840013027191162},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5575752258300781},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.5567293167114258},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5193318128585815},{"id":"https://openalex.org/keywords/inverted-index","display_name":"Inverted index","score":0.4758146405220032},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4148009419441223},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3355085849761963},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2917182743549347},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26686280965805054},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.2459709644317627},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18703636527061462},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.07745295763015747}],"concepts":[{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.816993236541748},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.7468396425247192},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.678764820098877},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5914897918701172},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.58901447057724},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5840013027191162},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5575752258300781},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.5567293167114258},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5193318128585815},{"id":"https://openalex.org/C130590232","wikidata":"https://www.wikidata.org/wiki/Q1671754","display_name":"Inverted index","level":3,"score":0.4758146405220032},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4148009419441223},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3355085849761963},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2917182743549347},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26686280965805054},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.2459709644317627},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18703636527061462},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.07745295763015747},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3201463.3201466","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3201463.3201466","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 21st International Workshop on the Web and Databases","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3948878529","display_name":null,"funder_award_id":"MI 1794/1-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1990111898","https://openalex.org/W1994655805","https://openalex.org/W2006307108","https://openalex.org/W2073083495","https://openalex.org/W2106299541","https://openalex.org/W2118269922","https://openalex.org/W2140048308","https://openalex.org/W2397233443","https://openalex.org/W2802112837"],"related_works":["https://openalex.org/W2148008870","https://openalex.org/W2381195555","https://openalex.org/W2368606575","https://openalex.org/W4246757943","https://openalex.org/W2085998272","https://openalex.org/W2132753198","https://openalex.org/W2369874856","https://openalex.org/W2182477562","https://openalex.org/W2792185758","https://openalex.org/W2787484455"],"abstract_inverted_index":{"In":[0],"this":[1,24],"work,":[2],"we":[3,26,52],"consider":[4],"processing":[5],"k-nearest-neighbor":[6],"(k-NN)":[7],"queries,":[8],"with":[9,74],"the":[10,14,47,64,67,75,79,84],"additional":[11],"requirement":[12],"that":[13,62],"result":[15],"objects":[16],"are":[17],"of":[18,34,66,77],"a":[19,32,54],"specific":[20],"type.":[21],"To":[22],"solve":[23],"problem,":[25],"propose":[27],"an":[28,35,58],"approach":[29],"based":[30],"on":[31],"combination":[33],"inverted":[36],"index":[37,42,69],"and":[38,57],"state-of-the-art":[39],"similarity":[40],"search":[41,48],"structure":[43,70],"for":[44,83],"efficiently":[45],"pruning":[46],"space":[49],"early-on.":[50],"Furthermore,":[51],"provide":[53],"cost":[55],"model,":[56],"extensive":[59],"experimental":[60],"study,":[61],"analyzes":[63],"performance":[65],"proposed":[68],"under":[71],"different":[72],"configurations,":[73],"aim":[76],"finding":[78],"most":[80],"efficient":[81],"one":[82],"dataset":[85],"being":[86],"searched.":[87]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
