• Refine your search:
  • 
    Keyword:
    
    • Distributed Radix Tree (1)
    • Metadata search (1)
    • Radix Tree (1)
    • Search (1)
    • distributed affix search (1)
    • distributed inverted index (1)
    • distributed search (1)
  • 
    Creator / Publisher:
    
    • Byna, S (1)
    • Chen, Y (1)
    • Evripidou, Skevos (1)
    • O'Boyle, Michael FP (1)
    • Stenström, Per (1)
    • Tang, H (1)
    • Zhang, W (1)
  • 
    Year:
    
    • 2018 (1)
  • 
    Medium:
    
    • Online (1)
  • 
    Type:
    
    • Article (1)
  • 
    BLLDB-Access:
    • free (1)
    • subject to license (0)

Search in the Catalogues and Directories

All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year Sort by creator [A → Z]' creator [Z → A]' publishing year ↑ (asc)' publishing year ↓ (desc)' title [A → Z]' title [Z → A]' Simple Search Hits 1 – 1 of 1 1 DART: Distributed adaptive radix tree for efficient affix-based keyword search on HPC systems Zhang, W; Tang, H; Byna, S; Chen, Y. - : eScholarship, University of California, 2018 Abstract: Affix-based search is a fundamental functionality for storage systems. It allows users to find desired datasets, where attributes of a dataset match an affix. While building inverted index to facilitate efficient affix based keyword search is a common practice for standalone databases and for desktop file systems, building local indexes or adopting indexing techniques used in a standalone data store is insufficient for highperformance computing (HPC) systems due to the massive amount of data and distributed nature of the storage devices within a system. In this paper, we propose Distributed Adaptive Radix Tree (DART), to address the challenge of distributed affix-based keyword search on HPC systems. This trie-based approach is scalable in achieving efficient affix-based search and alleviating imbalanced keyword distribution and excessive requests on keywords at scale. Our evaluation at different scales shows that, comparing with the "full string hashing" use case of the most popular distributed indexing technique - Distributed Hash Table (DHT), DART achieves up to 55× better throughput with prefix search and with suffix search, while achieving comparable throughput with exact and infix searches. Also, comparing to the "initial hashing" use case of DHT, DART maintains a balanced keyword distribution on distributed nodes and alleviates excessive query workload against popular keywords. Keyword: distributed affix search; distributed inverted index; Distributed Radix Tree; distributed search; Metadata search; Radix Tree; Search URL: https://escholarship.org/uc/item/1wn4x91w BASE Hide details

Mobile view All Catalogues UB Frankfurt Linguistik 0 IDS Mannheim 0 OLC Linguistik 0 UB Frankfurt Retrokatalog 0 DNB Subject Category Language 0 Institut für Empirische Sprachwissenschaft 0 Leibniz-Centre General Linguistics (ZAS) 0 Bibliographies BLLDB 0 BDSL 0 IDS Bibliografie zur deutschen Grammatik 0 IDS Bibliografie zur Gesprächsforschung 0 IDS Konnektoren im Deutschen 0 IDS Präpositionen im Deutschen 0 IDS OBELEX meta 0 MPI-SHH Linguistics Collection 0 MPI for Psycholinguistics 0 Linked Open Data catalogues Annohub 0 Online resources Link directory 0 Journal directory 0 Database directory 0 Dictionary directory 0 Open access documents BASE 1 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0