Andere Kunden interessierten sich auch für
![String Processing and Information Retrieval]( "String Processing and Information Retrieval")
String Processing and Information Retrieval37,99 €![String Processing and Information Retrieval]( "String Processing and Information Retrieval")
String Processing and Information Retrieval37,99 €![String Processing and Information Retrieval]( "String Processing and Information Retrieval")
String Processing and Information Retrieval37,99 €![Experimental Algorithms]( "Experimental Algorithms")
Experimental Algorithms37,99 €![String Processing and Information Retrieval]( "String Processing and Information Retrieval")
String Processing and Information Retrieval37,99 €![Combinatorics, Algorithms, Probabilistic and Experimental Methodologies]( "Combinatorics, Algorithms, Probabilistic and Experimental Methodologies")
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies39,99 €![Automata, Languages, and Programming]( "Automata, Languages, and Programming")
Automata, Languages, and Programming37,99 €
This volume tackles the conflicting requirements of data compression and indexing in massive datasets, by using optimization techniques to improve compression and reconfiguring data structure to increase the efficiency, and speed, of pattern-matching queries.
Data compression is mandatory to manage massive datasets, indexing is fundamental to query them. However, their goals appear as counterposed: the former aims at minimizing data redundancies, whereas the latter augments the dataset with auxiliary information to speed up the query resolution. In this monograph we introduce solutions that overcome this dichotomy. We start by presenting the use of optimization techniques to improve the compression of classical data compression algorithms, then we move to the design of compressed data structures providing fast random access or efficient pattern matching queries on the compressed dataset. These theoretical studies are supported by experimental evidences of their impact in practical scenarios.
Data compression is mandatory to manage massive datasets, indexing is fundamental to query them. However, their goals appear as counterposed: the former aims at minimizing data redundancies, whereas the latter augments the dataset with auxiliary information to speed up the query resolution. In this monograph we introduce solutions that overcome this dichotomy. We start by presenting the use of optimization techniques to improve the compression of classical data compression algorithms, then we move to the design of compressed data structures providing fast random access or efficient pattern matching queries on the compressed dataset. These theoretical studies are supported by experimental evidences of their impact in practical scenarios.