On Deletions in Open Addressing Hashing Article Swipe
YOU?
·
· 2018
· Open Access
·
· DOI: https://doi.org/10.1137/1.9781611975062.3
Deletions in open addressing tables have often been seen as problematic. The usual solution is to use a special mark ’deleted’ so that probe sequences continue past deleted slots, as if there was an element still sitting there. Such a solution, notwithstanding is wide applicability, may involve serious performance degradation. In the first part of this paper we review a practical implementation of the often overlooked deletion algorithm for linear probing hash tables, analyze its properties and performance, and provide several strong arguments in favor of the Robin Hood variant. In particular, we show how a small variation can yield substantial improvements for unsuccesful search. In the second part we propose an algorithm for true deletion in open addressing hashing with secondary clustering, like quadratic hashing. As far as we know, this is the first time that such an algorithm appears in the literature. Although it involves some extra memory for bookkeeping, the algorithm is comparatively easy and efficient, and might be of practical value, besides its theoretical interest.
Related Topics
- Type
- book-chapter
- Language
- en
- Landing Page
- https://doi.org/10.1137/1.9781611975062.3
- https://epubs.siam.org/doi/pdf/10.1137/1.9781611975062.3
- OA Status
- bronze
- Cited By
- 5
- References
- 16
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W2781977649
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W2781977649Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1137/1.9781611975062.3Digital Object Identifier
- Title
-
On Deletions in Open Addressing HashingWork title
- Type
-
book-chapterOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2018Year of publication
- Publication date
-
2018-01-01Full publication date if available
- Authors
-
Rosa María Rodríguez Jiménez, Conrado Martı́nezList of authors in order
- Landing page
-
https://doi.org/10.1137/1.9781611975062.3Publisher landing page
- PDF URL
-
https://epubs.siam.org/doi/pdf/10.1137/1.9781611975062.3Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
bronzeOpen access status per OpenAlex
- OA URL
-
https://epubs.siam.org/doi/pdf/10.1137/1.9781611975062.3Direct OA link when available
- Concepts
-
Linear hashing, Computer science, Hash table, Dynamic perfect hashing, Randomness, Hash function, Cluster analysis, Algorithm, Bookkeeping, Table (database), Theoretical computer science, Value (mathematics), Universal hashing, Locality-sensitive hashing, Double hashing, Data mining, Mathematics, Artificial intelligence, Machine learning, Statistics, Programming language, Economics, FinanceTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
5Total citation count in OpenAlex
- Citations by year (recent)
-
2025: 1, 2024: 1, 2022: 2, 2021: 1Per-year citation counts (last 5 years)
- References (count)
-
16Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W2781977649 |
|---|---|
| doi | https://doi.org/10.1137/1.9781611975062.3 |
| ids.doi | https://doi.org/10.1137/1.9781611975062.3 |
| ids.mag | 2781977649 |
| ids.openalex | https://openalex.org/W2781977649 |
| fwci | 0.28973907 |
| type | book-chapter |
| title | On Deletions in Open Addressing Hashing |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | 31 |
| biblio.first_page | 23 |
| topics[0].id | https://openalex.org/T11269 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9998000264167786 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1702 |
| topics[0].subfield.display_name | Artificial Intelligence |
| topics[0].display_name | Algorithms and Data Compression |
| topics[1].id | https://openalex.org/T11478 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9933000206947327 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1705 |
| topics[1].subfield.display_name | Computer Networks and Communications |
| topics[1].display_name | Caching and Content Delivery |
| topics[2].id | https://openalex.org/T10627 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9914000034332275 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1707 |
| topics[2].subfield.display_name | Computer Vision and Pattern Recognition |
| topics[2].display_name | Advanced Image and Video Retrieval Techniques |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C36375716 |
| concepts[0].level | 5 |
| concepts[0].score | 0.7760096788406372 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q6553456 |
| concepts[0].display_name | Linear hashing |
| concepts[1].id | https://openalex.org/C41008148 |
| concepts[1].level | 0 |
| concepts[1].score | 0.6720626950263977 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[1].display_name | Computer science |
| concepts[2].id | https://openalex.org/C67388219 |
| concepts[2].level | 3 |
| concepts[2].score | 0.6613008975982666 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q207440 |
| concepts[2].display_name | Hash table |
| concepts[3].id | https://openalex.org/C122907437 |
| concepts[3].level | 5 |
| concepts[3].score | 0.6588144302368164 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q5318999 |
| concepts[3].display_name | Dynamic perfect hashing |
| concepts[4].id | https://openalex.org/C125112378 |
| concepts[4].level | 2 |
| concepts[4].score | 0.6025106906890869 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q176640 |
| concepts[4].display_name | Randomness |
| concepts[5].id | https://openalex.org/C99138194 |
| concepts[5].level | 2 |
| concepts[5].score | 0.5806962251663208 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q183427 |
| concepts[5].display_name | Hash function |
| concepts[6].id | https://openalex.org/C73555534 |
| concepts[6].level | 2 |
| concepts[6].score | 0.5627402663230896 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q622825 |
| concepts[6].display_name | Cluster analysis |
| concepts[7].id | https://openalex.org/C11413529 |
| concepts[7].level | 1 |
| concepts[7].score | 0.5175794363021851 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[7].display_name | Algorithm |
| concepts[8].id | https://openalex.org/C105387459 |
| concepts[8].level | 2 |
| concepts[8].score | 0.49277451634407043 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q3707847 |
| concepts[8].display_name | Bookkeeping |
| concepts[9].id | https://openalex.org/C45235069 |
| concepts[9].level | 2 |
| concepts[9].score | 0.44205495715141296 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q278425 |
| concepts[9].display_name | Table (database) |
| concepts[10].id | https://openalex.org/C80444323 |
| concepts[10].level | 1 |
| concepts[10].score | 0.44083455204963684 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q2878974 |
| concepts[10].display_name | Theoretical computer science |
| concepts[11].id | https://openalex.org/C2776291640 |
| concepts[11].level | 2 |
| concepts[11].score | 0.43254998326301575 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q2912517 |
| concepts[11].display_name | Value (mathematics) |
| concepts[12].id | https://openalex.org/C116058348 |
| concepts[12].level | 5 |
| concepts[12].score | 0.4186328649520874 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q846912 |
| concepts[12].display_name | Universal hashing |
| concepts[13].id | https://openalex.org/C74270461 |
| concepts[13].level | 4 |
| concepts[13].score | 0.4142588675022125 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q1625299 |
| concepts[13].display_name | Locality-sensitive hashing |
| concepts[14].id | https://openalex.org/C138111711 |
| concepts[14].level | 4 |
| concepts[14].score | 0.3290233910083771 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q478351 |
| concepts[14].display_name | Double hashing |
| concepts[15].id | https://openalex.org/C124101348 |
| concepts[15].level | 1 |
| concepts[15].score | 0.2584667205810547 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q172491 |
| concepts[15].display_name | Data mining |
| concepts[16].id | https://openalex.org/C33923547 |
| concepts[16].level | 0 |
| concepts[16].score | 0.23483872413635254 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[16].display_name | Mathematics |
| concepts[17].id | https://openalex.org/C154945302 |
| concepts[17].level | 1 |
| concepts[17].score | 0.1741945445537567 |
| concepts[17].wikidata | https://www.wikidata.org/wiki/Q11660 |
| concepts[17].display_name | Artificial intelligence |
| concepts[18].id | https://openalex.org/C119857082 |
| concepts[18].level | 1 |
| concepts[18].score | 0.13448789715766907 |
| concepts[18].wikidata | https://www.wikidata.org/wiki/Q2539 |
| concepts[18].display_name | Machine learning |
| concepts[19].id | https://openalex.org/C105795698 |
| concepts[19].level | 1 |
| concepts[19].score | 0.12133929133415222 |
| concepts[19].wikidata | https://www.wikidata.org/wiki/Q12483 |
| concepts[19].display_name | Statistics |
| concepts[20].id | https://openalex.org/C199360897 |
| concepts[20].level | 1 |
| concepts[20].score | 0.11484828591346741 |
| concepts[20].wikidata | https://www.wikidata.org/wiki/Q9143 |
| concepts[20].display_name | Programming language |
| concepts[21].id | https://openalex.org/C162324750 |
| concepts[21].level | 0 |
| concepts[21].score | 0.0 |
| concepts[21].wikidata | https://www.wikidata.org/wiki/Q8134 |
| concepts[21].display_name | Economics |
| concepts[22].id | https://openalex.org/C10138342 |
| concepts[22].level | 1 |
| concepts[22].score | 0.0 |
| concepts[22].wikidata | https://www.wikidata.org/wiki/Q43015 |
| concepts[22].display_name | Finance |
| keywords[0].id | https://openalex.org/keywords/linear-hashing |
| keywords[0].score | 0.7760096788406372 |
| keywords[0].display_name | Linear hashing |
| keywords[1].id | https://openalex.org/keywords/computer-science |
| keywords[1].score | 0.6720626950263977 |
| keywords[1].display_name | Computer science |
| keywords[2].id | https://openalex.org/keywords/hash-table |
| keywords[2].score | 0.6613008975982666 |
| keywords[2].display_name | Hash table |
| keywords[3].id | https://openalex.org/keywords/dynamic-perfect-hashing |
| keywords[3].score | 0.6588144302368164 |
| keywords[3].display_name | Dynamic perfect hashing |
| keywords[4].id | https://openalex.org/keywords/randomness |
| keywords[4].score | 0.6025106906890869 |
| keywords[4].display_name | Randomness |
| keywords[5].id | https://openalex.org/keywords/hash-function |
| keywords[5].score | 0.5806962251663208 |
| keywords[5].display_name | Hash function |
| keywords[6].id | https://openalex.org/keywords/cluster-analysis |
| keywords[6].score | 0.5627402663230896 |
| keywords[6].display_name | Cluster analysis |
| keywords[7].id | https://openalex.org/keywords/algorithm |
| keywords[7].score | 0.5175794363021851 |
| keywords[7].display_name | Algorithm |
| keywords[8].id | https://openalex.org/keywords/bookkeeping |
| keywords[8].score | 0.49277451634407043 |
| keywords[8].display_name | Bookkeeping |
| keywords[9].id | https://openalex.org/keywords/table |
| keywords[9].score | 0.44205495715141296 |
| keywords[9].display_name | Table (database) |
| keywords[10].id | https://openalex.org/keywords/theoretical-computer-science |
| keywords[10].score | 0.44083455204963684 |
| keywords[10].display_name | Theoretical computer science |
| keywords[11].id | https://openalex.org/keywords/value |
| keywords[11].score | 0.43254998326301575 |
| keywords[11].display_name | Value (mathematics) |
| keywords[12].id | https://openalex.org/keywords/universal-hashing |
| keywords[12].score | 0.4186328649520874 |
| keywords[12].display_name | Universal hashing |
| keywords[13].id | https://openalex.org/keywords/locality-sensitive-hashing |
| keywords[13].score | 0.4142588675022125 |
| keywords[13].display_name | Locality-sensitive hashing |
| keywords[14].id | https://openalex.org/keywords/double-hashing |
| keywords[14].score | 0.3290233910083771 |
| keywords[14].display_name | Double hashing |
| keywords[15].id | https://openalex.org/keywords/data-mining |
| keywords[15].score | 0.2584667205810547 |
| keywords[15].display_name | Data mining |
| keywords[16].id | https://openalex.org/keywords/mathematics |
| keywords[16].score | 0.23483872413635254 |
| keywords[16].display_name | Mathematics |
| keywords[17].id | https://openalex.org/keywords/artificial-intelligence |
| keywords[17].score | 0.1741945445537567 |
| keywords[17].display_name | Artificial intelligence |
| keywords[18].id | https://openalex.org/keywords/machine-learning |
| keywords[18].score | 0.13448789715766907 |
| keywords[18].display_name | Machine learning |
| keywords[19].id | https://openalex.org/keywords/statistics |
| keywords[19].score | 0.12133929133415222 |
| keywords[19].display_name | Statistics |
| keywords[20].id | https://openalex.org/keywords/programming-language |
| keywords[20].score | 0.11484828591346741 |
| keywords[20].display_name | Programming language |
| language | en |
| locations[0].id | doi:10.1137/1.9781611975062.3 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306463922 |
| locations[0].source.issn | |
| locations[0].source.type | ebook platform |
| locations[0].source.is_oa | False |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Society for Industrial and Applied Mathematics eBooks |
| locations[0].source.host_organization | https://openalex.org/P4310320508 |
| locations[0].source.host_organization_name | Society for Industrial and Applied Mathematics |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310320508 |
| locations[0].source.host_organization_lineage_names | Society for Industrial and Applied Mathematics |
| locations[0].license | |
| locations[0].pdf_url | https://epubs.siam.org/doi/pdf/10.1137/1.9781611975062.3 |
| locations[0].version | publishedVersion |
| locations[0].raw_type | book-chapter |
| locations[0].license_id | |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | 2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) |
| locations[0].landing_page_url | https://doi.org/10.1137/1.9781611975062.3 |
| locations[1].id | pmh:oai:recercat.cat:2072/340858 |
| locations[1].is_oa | True |
| locations[1].source | |
| locations[1].license | other-oa |
| locations[1].pdf_url | |
| locations[1].version | publishedVersion |
| locations[1].raw_type | info:eu-repo/semantics/publishedVersion |
| locations[1].license_id | https://openalex.org/licenses/other-oa |
| locations[1].is_accepted | True |
| locations[1].is_published | True |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | http://hdl.handle.net/2117/91265 |
| locations[2].id | pmh:oai:recercat.cat:2072/341446 |
| locations[2].is_oa | True |
| locations[2].source | |
| locations[2].license | other-oa |
| locations[2].pdf_url | |
| locations[2].version | acceptedVersion |
| locations[2].raw_type | info:eu-repo/semantics/submittedVersion |
| locations[2].license_id | https://openalex.org/licenses/other-oa |
| locations[2].is_accepted | True |
| locations[2].is_published | False |
| locations[2].raw_source_name | |
| locations[2].landing_page_url | http://hdl.handle.net/2117/122770 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5090166954 |
| authorships[0].author.orcid | https://orcid.org/0000-0003-0467-2886 |
| authorships[0].author.display_name | Rosa María Rodríguez Jiménez |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Rosa M. Jiménez |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5049508203 |
| authorships[1].author.orcid | https://orcid.org/0000-0003-1302-9067 |
| authorships[1].author.display_name | Conrado Martı́nez |
| authorships[1].author_position | last |
| authorships[1].raw_author_name | Conrado Martínez |
| authorships[1].is_corresponding | False |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://epubs.siam.org/doi/pdf/10.1137/1.9781611975062.3 |
| open_access.oa_status | bronze |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | On Deletions in Open Addressing Hashing |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T11269 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9998000264167786 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1702 |
| primary_topic.subfield.display_name | Artificial Intelligence |
| primary_topic.display_name | Algorithms and Data Compression |
| related_works | https://openalex.org/W2044784665, https://openalex.org/W3030563642, https://openalex.org/W1870428314, https://openalex.org/W2000284985, https://openalex.org/W2293015666, https://openalex.org/W2158169729, https://openalex.org/W2086731314, https://openalex.org/W2921167217, https://openalex.org/W2120031510, https://openalex.org/W2899968640 |
| cited_by_count | 5 |
| counts_by_year[0].year | 2025 |
| counts_by_year[0].cited_by_count | 1 |
| counts_by_year[1].year | 2024 |
| counts_by_year[1].cited_by_count | 1 |
| counts_by_year[2].year | 2022 |
| counts_by_year[2].cited_by_count | 2 |
| counts_by_year[3].year | 2021 |
| counts_by_year[3].cited_by_count | 1 |
| locations_count | 3 |
| best_oa_location.id | doi:10.1137/1.9781611975062.3 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306463922 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | ebook platform |
| best_oa_location.source.is_oa | False |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | Society for Industrial and Applied Mathematics eBooks |
| best_oa_location.source.host_organization | https://openalex.org/P4310320508 |
| best_oa_location.source.host_organization_name | Society for Industrial and Applied Mathematics |
| best_oa_location.source.host_organization_lineage | https://openalex.org/P4310320508 |
| best_oa_location.source.host_organization_lineage_names | Society for Industrial and Applied Mathematics |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://epubs.siam.org/doi/pdf/10.1137/1.9781611975062.3 |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | book-chapter |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | 2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) |
| best_oa_location.landing_page_url | https://doi.org/10.1137/1.9781611975062.3 |
| primary_location.id | doi:10.1137/1.9781611975062.3 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306463922 |
| primary_location.source.issn | |
| primary_location.source.type | ebook platform |
| primary_location.source.is_oa | False |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Society for Industrial and Applied Mathematics eBooks |
| primary_location.source.host_organization | https://openalex.org/P4310320508 |
| primary_location.source.host_organization_name | Society for Industrial and Applied Mathematics |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310320508 |
| primary_location.source.host_organization_lineage_names | Society for Industrial and Applied Mathematics |
| primary_location.license | |
| primary_location.pdf_url | https://epubs.siam.org/doi/pdf/10.1137/1.9781611975062.3 |
| primary_location.version | publishedVersion |
| primary_location.raw_type | book-chapter |
| primary_location.license_id | |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | 2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) |
| primary_location.landing_page_url | https://doi.org/10.1137/1.9781611975062.3 |
| publication_date | 2018-01-01 |
| publication_year | 2018 |
| referenced_works | https://openalex.org/W3125468371, https://openalex.org/W1564014376, https://openalex.org/W2061889429, https://openalex.org/W1979228272, https://openalex.org/W2151454836, https://openalex.org/W2015853688, https://openalex.org/W2070755358, https://openalex.org/W1491028831, https://openalex.org/W1546693390, https://openalex.org/W2115559007, https://openalex.org/W2079527850, https://openalex.org/W1990521264, https://openalex.org/W3198160809, https://openalex.org/W2018014111, https://openalex.org/W1992985195, https://openalex.org/W1983780347 |
| referenced_works_count | 16 |
| abstract_inverted_index.a | 17, 39, 59, 95 |
| abstract_inverted_index.As | 126 |
| abstract_inverted_index.In | 50, 90, 105 |
| abstract_inverted_index.an | 33, 111, 138 |
| abstract_inverted_index.as | 9, 29, 128 |
| abstract_inverted_index.be | 161 |
| abstract_inverted_index.if | 30 |
| abstract_inverted_index.in | 1, 83, 116, 141 |
| abstract_inverted_index.is | 14, 42, 132, 154 |
| abstract_inverted_index.it | 145 |
| abstract_inverted_index.of | 54, 62, 85, 162 |
| abstract_inverted_index.so | 21 |
| abstract_inverted_index.to | 15 |
| abstract_inverted_index.we | 57, 92, 109, 129 |
| abstract_inverted_index.The | 11 |
| abstract_inverted_index.and | 76, 78, 157, 159 |
| abstract_inverted_index.can | 98 |
| abstract_inverted_index.far | 127 |
| abstract_inverted_index.for | 68, 102, 113, 150 |
| abstract_inverted_index.how | 94 |
| abstract_inverted_index.its | 74, 166 |
| abstract_inverted_index.may | 45 |
| abstract_inverted_index.the | 51, 63, 86, 106, 133, 142, 152 |
| abstract_inverted_index.use | 16 |
| abstract_inverted_index.was | 32 |
| abstract_inverted_index.Hood | 88 |
| abstract_inverted_index.Such | 38 |
| abstract_inverted_index.been | 7 |
| abstract_inverted_index.easy | 156 |
| abstract_inverted_index.hash | 71 |
| abstract_inverted_index.have | 5 |
| abstract_inverted_index.like | 123 |
| abstract_inverted_index.mark | 19 |
| abstract_inverted_index.open | 2, 117 |
| abstract_inverted_index.part | 53, 108 |
| abstract_inverted_index.past | 26 |
| abstract_inverted_index.seen | 8 |
| abstract_inverted_index.show | 93 |
| abstract_inverted_index.some | 147 |
| abstract_inverted_index.such | 137 |
| abstract_inverted_index.that | 22, 136 |
| abstract_inverted_index.this | 55, 131 |
| abstract_inverted_index.time | 135 |
| abstract_inverted_index.true | 114 |
| abstract_inverted_index.wide | 43 |
| abstract_inverted_index.with | 120 |
| abstract_inverted_index.Robin | 87 |
| abstract_inverted_index.extra | 148 |
| abstract_inverted_index.favor | 84 |
| abstract_inverted_index.first | 52, 134 |
| abstract_inverted_index.know, | 130 |
| abstract_inverted_index.might | 160 |
| abstract_inverted_index.often | 6, 64 |
| abstract_inverted_index.paper | 56 |
| abstract_inverted_index.probe | 23 |
| abstract_inverted_index.small | 96 |
| abstract_inverted_index.still | 35 |
| abstract_inverted_index.there | 31 |
| abstract_inverted_index.usual | 12 |
| abstract_inverted_index.yield | 99 |
| abstract_inverted_index.linear | 69 |
| abstract_inverted_index.memory | 149 |
| abstract_inverted_index.review | 58 |
| abstract_inverted_index.second | 107 |
| abstract_inverted_index.slots, | 28 |
| abstract_inverted_index.strong | 81 |
| abstract_inverted_index.tables | 4 |
| abstract_inverted_index.there. | 37 |
| abstract_inverted_index.value, | 164 |
| abstract_inverted_index.analyze | 73 |
| abstract_inverted_index.appears | 140 |
| abstract_inverted_index.besides | 165 |
| abstract_inverted_index.deleted | 27 |
| abstract_inverted_index.element | 34 |
| abstract_inverted_index.hashing | 119 |
| abstract_inverted_index.involve | 46 |
| abstract_inverted_index.probing | 70 |
| abstract_inverted_index.propose | 110 |
| abstract_inverted_index.provide | 79 |
| abstract_inverted_index.search. | 104 |
| abstract_inverted_index.serious | 47 |
| abstract_inverted_index.several | 80 |
| abstract_inverted_index.sitting | 36 |
| abstract_inverted_index.special | 18 |
| abstract_inverted_index.tables, | 72 |
| abstract_inverted_index.Although | 144 |
| abstract_inverted_index.continue | 25 |
| abstract_inverted_index.deletion | 66, 115 |
| abstract_inverted_index.hashing. | 125 |
| abstract_inverted_index.involves | 146 |
| abstract_inverted_index.solution | 13 |
| abstract_inverted_index.variant. | 89 |
| abstract_inverted_index.Deletions | 0 |
| abstract_inverted_index.algorithm | 67, 112, 139, 153 |
| abstract_inverted_index.arguments | 82 |
| abstract_inverted_index.interest. | 168 |
| abstract_inverted_index.practical | 60, 163 |
| abstract_inverted_index.quadratic | 124 |
| abstract_inverted_index.secondary | 121 |
| abstract_inverted_index.sequences | 24 |
| abstract_inverted_index.solution, | 40 |
| abstract_inverted_index.variation | 97 |
| abstract_inverted_index.addressing | 3, 118 |
| abstract_inverted_index.efficient, | 158 |
| abstract_inverted_index.overlooked | 65 |
| abstract_inverted_index.properties | 75 |
| abstract_inverted_index.clustering, | 122 |
| abstract_inverted_index.literature. | 143 |
| abstract_inverted_index.particular, | 91 |
| abstract_inverted_index.performance | 48 |
| abstract_inverted_index.substantial | 100 |
| abstract_inverted_index.theoretical | 167 |
| abstract_inverted_index.unsuccesful | 103 |
| abstract_inverted_index.bookkeeping, | 151 |
| abstract_inverted_index.degradation. | 49 |
| abstract_inverted_index.improvements | 101 |
| abstract_inverted_index.performance, | 77 |
| abstract_inverted_index.problematic. | 10 |
| abstract_inverted_index.comparatively | 155 |
| abstract_inverted_index.’deleted’ | 20 |
| abstract_inverted_index.applicability, | 44 |
| abstract_inverted_index.implementation | 61 |
| abstract_inverted_index.notwithstanding | 41 |
| cited_by_percentile_year.max | 96 |
| cited_by_percentile_year.min | 89 |
| countries_distinct_count | 0 |
| institutions_distinct_count | 2 |
| citation_normalized_percentile.value | 0.48403123 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |