Item request has been placed!

Item request cannot be made.

Processing Request

Search Results

Display Settings

Results per page: 10

Sort By: Relevance

Your Filters

Subject : 0102 computer and information sciences

Item request has been placed!

Item request cannot be made.

Processing Request

Academic Journal

On the weak prefix-search problem

Authors : FERRAGINA, PAOLO

Subjects: Prefix search, Compressed indexes for string dictionaries, Weighted data structures, Energy-efficient data structures; 0102 computer and information sciences; 01 natural sciences

Source: Lecture Notes in Computer Science ISBN: 9783642214578

Read Online Read More Add to Saved list

Academic Journal

A dictionary for approximate string search and longest prefix search

Authors : Sreenivas Gollapudi; Rina Panigrahy

Subjects: 0102 computer and information sciences; 01 natural sciences

Source: Proceedings of the 15th ACM international conference on Information and knowledge management - CIKM '06. :768

Read Online Read More Add to Saved list

Academic Journal

Top Tree Compression of Tries

Authors : Paweł Gawrychowski; Oren Weimann; Inge Li Gørtz ...

Subjects: FOS: Computer and information sciences; top trees; Tree compression

Source: Bille, P, Gawrychowski, P, Gørtz, I L, Landau, G M & Weimann, O 2019, Top Tree Compression of Tries . in Proceedings of 30th International Symposium on Algorithms and Computation . Schloss

Read Online Read More Add to Saved list

Academic Journal

c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches

Authors : Kazuya Tsuruta; Dominik Köppl; Shunsuke Kanda

Subjects: FOS: Computer and information sciences; Computer Science - Data Structures and Algorithms; 0202 electrical engineering, electronic engineering, information engineering

Source: 2020 Data Compression Conference (DCC). :243-252

Read Online Read More Add to Saved list

Book

Compressed Cache-Oblivious String B-tree

Authors : FERRAGINA, PAOLO; VENTURINI, ROSSANO

Subjects: Compressed index; Data compression; Indexing data structure

Source: Lecture Notes in Computer Science ISBN: 9783642404498ACM Transactions on AlgorithmsACM transactions on algorithms 12 (2016). doi:10.1145/2903141info:cnr-pdr/source/autori:Ferragina,

Read Online Read More Add to Saved list

Academic Journal

The wavelet trie: maintaining an indexed sequence of strings in compressed space

Authors : GROSSI, ROBERTO; Ottaviano G.

Subjects: FOS: Computer and information sciences; Computer Science - Databases; Computer Science - Data Structures and Algorithms

Source: Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems. :203-214

Read Online Read More Add to Saved list

Academic Journal

Minimal indices for predecessor search

Authors : Sarel Cohen; Moshik Hershcovitch; Haim Kaplan

Subjects: 0102 computer and information sciences; 01 natural sciences

Source: Information and Computation. 240:12-30

Read Online Read More Add to Saved list

Academic Journal

A self-stabilizing Hashed Patricia Trie

Authors : Christian Scheideler; Till Knollmann

Subjects: FOS: Computer and information sciences; Computer Science - Distributed, Parallel, and Cluster Computing; Distributed, Parallel, and Cluster Computing (cs.DC)

Source: Lecture Notes in Computer Science ISBN: 9783030032319

Read Online Read More Add to Saved list

Academic Journal

Coded and Scalar Prefix Trees: Prefix Matching Using the Novel Idea of Double Relation Chains

Authors : Mohammad Behdadfar; Massoud Reza Hashemi; Hossein Saidi

Subjects: 0102 computer and information sciences; 01 natural sciences

Source: ETRI Journal. 33:344-354

Read Online Read More Add to Saved list