Search references for COMPRESSED DATA-STRUCTURE. Phrases containing COMPRESSED DATA-STRUCTURE
See searches and references containing COMPRESSED DATA-STRUCTURE!COMPRESSED DATA-STRUCTURE
The term compressed data structure arises in the computer science subfields of algorithms, data structures, and theoretical computer science. It refers
Compressed_data_structure
Data structure which is efficient to both store in memory and query
that of a compressed data structure, insofar as the size of the stored or encoded data similarly depends upon the specific content of the data itself. Suppose
Succinct_data_structure
Compressed data structure for pattern matching
science, a compressed suffix array is a compressed data structure for pattern matching. Compressed suffix arrays are a general class of data structure that
Compressed_suffix_array
Data organization and storage formats
Brodal queue In these data structures each tree node compares a bit slice of key values. Radix tree Suffix tree Suffix array Compressed suffix array FM-index
List_of_data_structures
Abstract data type for storing distinct values
set, one typically tests a value for membership in a set. Some set data structures are designed for static or frozen sets that do not change after they
Set_(abstract_data_type)
Data structure for storing non-overlapping sets
computer science, a disjoint-set data structure, also called a union–find data structure or merge–find set, is a data structure that stores a collection of
Disjoint-set_data_structure
Signal processing technique
Compressed sensing (also known as compressive sensing, compressive sampling, or sparse sampling) is a signal processing technique for efficiently acquiring
Compressed_sensing
Lossless data compression software
fit seamlessly into Unix environments and their usual structure and behavior. XZ Utils can compress and decompress the xz and lzma file formats. Since the
XZ_Utils
Abstract data type in computer science
be part of the graph structure, or may be external entities represented by integer indices or references. A graph data structure may also associate to
Graph_(abstract_data_type)
Data structure for Boolean functions
compressed representations, operations are performed directly on the compressed representation, i.e. without decompression. Similar data structures include
Binary_decision_diagram
File format and file compression program
they were originally one file), normally only a single file is compressed. Compressed archives are typically created by assembling collections of files
Gzip
Family of archive file formats
that supports lossless data compression. A ZIP file may contain one or more files or directories that may have been compressed. The ZIP file format permits
ZIP_(file_format)
Finite, ordered collection of items
considered a distinct item. The term list is also used for several concrete data structures that can be used to implement abstract lists, especially linked lists
List_(abstract_data_type)
Capacity of a material or structure to withstand loads tending to reduce size
In mechanics, compressive strength (or compression strength) is the capacity of a material or structure to withstand loads tending to reduce size (compression)
Compressive_strength
Family of lossless data compression algorithms
lossless data compression algorithms which operate by searching for matches between the text to be compressed and a set of strings contained in a data structure
Dictionary_coder
Metadata standard in digital media
PCM or ITU-T G.711 μ-law PCM for uncompressed audio data, and IMA-ADPCM for compressed audio data). It does not support JPEG 2000 or GIF encoded images
Exif
Tree data structure that partitions a 2D area
A quadtree is a tree data structure in which each internal node has exactly four children. Quadtrees are the two-dimensional analog of octrees and are
Quadtree
Facility used to house computer servers
data center development, reflecting the growing importance of securing electrical capacity and resilient power systems within increasingly compressed
Data_center
Search tree data structure
by storing the positions of their occurrences in a compressed trie sequence databases. Compressed variants of tries, such as databases for managing Forwarding
Trie
Computer format for digital audio
coding format and can be uncompressed, or compressed to reduce the file size, often using lossy compression. The data can be a raw bitstream in an audio coding
Audio_file_format
Data structure in computer science
is a data structure that uses a single, fixed-size buffer as if it were connected end-to-end. This structure lends itself easily to buffering data streams
Circular_buffer
Discrete, discontinuous representation of information
However, digital data can be compressed. Compression reduces the amount of bandwidth space needed to send information. Data can be compressed, sent, and then
Digital_data
Mapping function that preserves data point locality
result of this is a compressed quadtree, where only nodes containing input points or two or more children are present. A non-compressed quadtree can be built
Z-order_curve
WAP security protocol
WTLS defines a compressed certificate format. This broadly follows the X.509 v3 certificate structure, but uses smaller data structures. Packet based design
Wireless Transport Layer Security
Wireless_Transport_Layer_Security
Recording of information in a storage medium
2007. These figures correspond to less than three compressed exabytes in 1986, and 295 compressed exabytes in 2007. The quantity of digital storage doubled
Data_storage
Proprietary file system developed by Microsoft
each compressed file with a WOF (Windows Overlay Filter) tag, but the actual data is stored in an alternate data stream named "WofCompressedData", which
NTFS
are compressed, often by the SQ program. 7Z – 7-zip compressed file ACE – ace: ACE compressed file ALZ – ALZip compressed file ARC – pre-Zip data compression
List_of_file_formats
Lossless compression algorithm
block). 01: A static Huffman compressed block, using a pre-agreed Huffman tree defined in the RFC. 10: A dynamic Huffman compressed block, complete with the
Deflate
Device or program that encodes/decodes audio data in some bitstream format
digital data stream (a codec) that encodes or decodes audio. In software, an audio codec is a computer program implementing an algorithm that compresses and
Audio_codec
Statistical method of dividing data into equal-sized intervals for analysis
Computing approximate quantiles from data arriving from a stream can be done efficiently using compressed data structures. The most popular methods are t-digest
Quantile
Computer programming method
the data structures of the files that a program must read as input and produce as output, and then produce a program design based on those data structures
Jackson structured programming
Jackson_structured_programming
Type of formal grammar
compressed structures (without prior decompression). SLGs are of interest in fields like Kolmogorov complexity, Lossless data compression, Structure discovery
Straight-line_grammar
Type of data transmission method
while data compression consists of producing a compressed file given a target, and decompression consists of producing a target given only a compressed file
Delta_encoding
Data compression approach allowing perfect reconstruction of the original data
compression is a class of data compression that allows the original data to be perfectly reconstructed from the compressed data with no loss of information
Lossless_compression
Arrangement of interrelated elements in an object/system, or the object/system itself
minerals and chemicals. Abstract structures include data structures in computer science and musical form. Types of structure include a hierarchy (a cascade
Structure
Family of chemical file formats
Molfile V3000 can represent Markush structures)" There are also alternative encodings derived from the formats: Compressed versions Chemaxon provides a compressor
Chemical_table_file
Digital video coder/decoder
while a device that only compresses is typically called an encoder, and one that only decompresses is a decoder. The compressed data format usually conforms
Video_codec
Standardized means of organizing and storing digital images
2D images, not 3D ones. The data stored in an image file format may be compressed or uncompressed. If the data is compressed, it may be done so using lossy
Image_file_format
Vowel sound represented by ⟨ø̞⟩ or ⟨œ̝⟩ in IPA
vowels. See mid near-front rounded vowel for other examples. The mid front compressed vowel is typically transcribed in IPA simply as ⟨ø̞⟩ or ⟨œ̝⟩. This article
Mid_front_rounded_vowel
Method for data management
File compressed using bzip2 Tape ARchive (TAR), Unix archive file, not (itself) compressed TAR.Z, TAR.GZ or TAR.BZ2 - Unix archive files compressed with
Search_engine_indexing
Family of higher-order functions
accumulate, aggregate, compress, or inject. Typically, a fold is presented with a combining function, a top node of a data structure, and possibly some default
Fold_(higher-order_function)
Raw data of genome sequencing
Alignment Map) is the lossless, compressed binary representation of a Sequence Alignment Map file. It is compressed by BGZF library and supports fast
BAM_(file_format)
Data structure
suffix tree. The compressed suffix array, a data structure that combines data compression with the suffix array, allowing the structure to be stored in
Substring_index
Data structure used in image rendering
set is a data structure designed to represent discretely sampled dynamic level sets of functions. A common use of this form of data structure is in efficient
Level_set_(data_structures)
a compressed trie data structure. It achieves lower memory and query time requirements at the expense of reduced flexibility. Maly, K. Compressed tries
C-trie
Technique used in signal processing and data compression
S2CID 18016215 Yeo, B.; Liu, B. (May 1995), "Volume rendering of DCT-based compressed 3D scalar data", IEEE Transactions on Visualization and Computer Graphics, 1
Discrete_cosine_transform
archive formats losslessly compress the data to consume less storage space and result in faster transfer times as the same data is represented by fewer bytes
List_of_archive_formats
ISO/IEC standard for genomic information representation
the following list: Data format and compression Data streaming Compressed file concatenation Incremental update of sequencing data and metadata Selective
MPEG-G
File format for block-based Gzip compression
index file is created for a BGZF-compressed file, typically using Tabix. This index stores the file offsets of the compressed blocks alongside the corresponding
BGZF
Image file format with multiple editions
M, "Compressed Image File Formats"; 1999, Addison-Wesley ISBN 978-0-201-60443-6 Pennebaker, William B. and Joan L. Mitchell: JPEG still image data compression
JPEG_File_Interchange_Format
Functional programming construct
used in some programming languages as a general tool to process data based on its structure, e.g. C#, F#, Haskell, Java, ML, Python, Racket, Ruby, Rust,
Pattern_matching
Average uncertainty in variable's states
character. A compressed message has less redundancy. Shannon's source coding theorem states a lossless compression scheme cannot compress messages, on
Entropy_(information_theory)
algorithm Jeffrey Scott Vitter – external memory algorithms, compressed data structures, data compression, databases Paul Vixie – DNS, BIND, PAIX, Internet
List_of_computer_scientists
American computer scientist
He has made fundamental contributions in databases; compressed data structures and indexing; data compression, including adaptive Huffman coding, arithmetic
Jeffrey_Vitter
Methods of compressing data tailored specifically for genomic data
consensus reference may contain less bias in its data. Knowledge about the source of the sequence being compressed, however, may be exploited to achieve greater
Compression of genomic sequencing data
Compression_of_genomic_sequencing_data
File format and file archiver program
gzip, bzip2, xz, lzip, lzma, zstd, or compress, which compress the entire tar archive. Typically, the compressed form of the archive receives a filename
Tar_(computing)
Series of image file formats
sample values. TIFF images may be uncompressed, compressed using a lossless compression scheme, or compressed using a lossy compression scheme. The lossless
TIFF
Compressed full-text substring index
to solve the compressed matching problem. In contrast, the FM-index is a compressed self-index, which means that it compresses the data and indexes it
FM-index
Data storage technologies that use magnetic tape
) typically compress much better than other types of data stored on computer systems. By contrast, encrypted data and pre-compressed data (PGP, ZIP, JPEG
Magnetic-tape_data_storage
Searching for patterns in compressed data
In computer science, compressed pattern matching (abbreviated as CPM) is the process of searching for patterns in compressed data with little or no decompression
Compressed_pattern_matching
Matrix in which most of the elements are zero
efficient access and matrix operations, such as CSR (Compressed Sparse Row) or CSC (Compressed Sparse Column). DOK consists of a dictionary that maps
Sparse_matrix
Data about other data
the book. But, while a data asset is finite, its metadata is infinite. As such, efforts to define, classify types, or structure metadata are expressed
Metadata
Archive file format created for Microsoft Windows
folder is treated as a single compressed block, which provides more efficient compression than individually compressing each file. Every entry in a folder
Cabinet_(file_format)
Standard protocol for transferring files over TCP/IP networks
data into several blocks (block header, byte count, and data field) and then passes it on to TCP. Compressed mode (MODE C): Extends MODE B with data compression
File_Transfer_Protocol
Online media database
provide an API for automated queries. However, most of the data can be downloaded as compressed plain text files and the information can be extracted using
IMDb
For interchange of Lidar point cloud data
standard for compressed point cloud data. LAZ files are similar in structure to the corresponding uncompressed LAS files, except the point data records are
LAS_file_format
Family of lossless-compression image file formats
filters take account of the 2-dimensional image structure to further compress files; as filtered data encodes differences between pixels, they will tend
PNG
Lossless data compression algorithms
same basic principle, they can vary widely in how they encode their compressed data to vary the numerical ranges of a length–distance pair, alter the number
LZ77_and_LZ78
Facts provided or learned about something or someone
within the signal or message. Information may be structured as data. Redundant data can be compressed up to an optimal size, which is the theoretical limit
Information
^XML data bindings and SOAP serialization tools provide type-safe XML serialization of programming data structures into XML. Shown are
Comparison of data-serialization formats
Comparison_of_data-serialization_formats
Magnetic tape data storage technology
both units and compressed capacity. Media unit shipments peaked in 2008, at about 28 million. However, the 152.9 Exabytes of total compressed storage capacity
Linear_Tape-Open
Tree data structure
The compressed cover tree is a type of data structure in computer science that is specifically designed to facilitate the speed-up of a k-nearest neighbors
Compressed_cover_tree
General three-dimensional form of local segments of proteins
assignment of secondary structure as a potential hypothesis that attempts to explain (compress) given protein coordinate data. The core idea is that the
Protein_secondary_structure
File format for message access control
YY YY Compressed chunk length XX XX XX XX. The chunk body consists of X bytes of compressed data. The concatenated data chunks form a single data stream
Rpmsg
Disk compression utility
the compressed contents of a compressed drive was stored in a single file implied the possibility of a user accidentally deleting all of their data by
DriveSpace
Finance and accounting management process
voucher posting (to general ledger) storing vouchers in de-normalized and compressed format generating analysis account trial balance or consolidated analysis
Record_to_report
Succinct data structure
The wavelet tree is a succinct data structure to store strings in compressed space. It generalizes the r a n k q {\displaystyle \mathbf {rank} _{q}} and
Wavelet_Tree
Data structure
of a database system. Any change in structure does not affect performance due to balanced tree properties. The data is stored in the leaf nodes and more
B+_tree
Standardized debugging data format
ELF_COMPRESSED flag to the section flags, allowing most ELF section to use this feature. Despite the clever encoding schemes built into DWARF, DWARF data
DWARF
Directed graph with no directed cycles
acyclic word graphs can be viewed as a compressed form of tries, binary decision diagrams can be viewed as compressed forms of decision trees that save space
Directed_acyclic_graph
Type of computer memory
(50 Mword/s). Each bit of data in a DRAM is stored as a positive or negative electrical charge in a capacitive structure. The structure providing the capacitance
Dynamic_random-access_memory
American computer scientist
construction, pattern matching in compressed data, cache-oblivious algorithms, and lowest common ancestor data structures. He is the Leonard J. Shustek Professor
Martin_Farach-Colton
Storage of digital data readable by computers
possible delays in data availability is done before deciding whether to keep certain data compressed or not. Distinct types of data storage have different
Computer_data_storage
Australian and American mathematician (born 1975)
arithmetic combinatorics, geometric combinatorics, probability theory, compressed sensing, and analytic number theory. Tao's father, Billy Tao, was a Chinese
Terence_Tao
Array data structure that compactly stores bits
or bit vector) is an array data structure that compactly stores bits. It can be used to implement a simple set data structure. A bit array is effective
Bit_array
File with the content of other files plus associated metadata
more computer files, possibly compressed and/or encrypted, with associated metadata such as file name, directory structure, error detection and correction
Archive_file
Internet Protocol encapsulation for serial ports and router connections
binary data through those modems that would recognize some characters as commands. A version of SLIP with header compression is called Compressed SLIP (CSLIP)
Serial_Line_Internet_Protocol
British computational biologist
R. (2011). "Efficient de novo assembly of large genomes using compressed data structures". Genome Research. 22 (3): 549–556. doi:10.1101/gr.126953.111
Richard_M._Durbin
Data mining technique
different activity. Sequential pattern mining is a special case of structured data mining. There are several key traditional computational problems addressed
Sequential_pattern_mining
Type of data compression
Adaptive compression is a type of data compression which changes compression algorithms based on the type of data being compressed. "Adaptive compression". PC
Adaptive_compression
Mathematical result
applications in compressed sensing, manifold learning, dimensionality reduction, graph embedding, and natural language processing. Much of the data stored and
Johnson–Lindenstrauss_lemma
Presentation of data for humans to read
are far easier for humans to read. In addition, these structured representations can be compressed very effectively for transmission or storage. Human-readable
Human-readable medium and data
Human-readable_medium_and_data
Data structure for approximate set membership
In computing, a Bloom filter is a space-efficient probabilistic data structure, conceived by Burton Howard Bloom in 1970, that is used to test whether
Bloom_filter
Digital audio format
reproduction. Some audio is hard to compress because of its randomness and sharp attacks. When this type of audio is compressed, artifacts such as ringing or
MP3
Award in theoretical computer science
"The ACM Paris Kanellakis Theory and Practice Award goes to pioneers in data compression" (Press release). ACM. 26 Mar 1998. Archived from the original
Paris_Kanellakis_Award
File format used to present documents
(<<...>>) Streams, usually containing large amounts of optionally compressed binary data, preceded by a dictionary and enclosed between the stream and endstream
Branch of civil engineering dealing with man-made structures
dynamic loads such as waves or traffic, or high pressures from water or compressed gases. They are also often constructed in corrosive environments, such
Structural_engineering
Type of GIS data format
Smart Data Compression is a compressed GIS dataset format developed by Esri. It stores all types of feature data and attribute information together as
Smart_Data_Compression
Chemical element with atomic number 1 (H)
kilogram (2.2 lb) of diethyl ether. H2 can be stored in compressed form, although compressing costs energy. Liquefaction is impractical given hydrogen's
Hydrogen
Widely used CAD 3D data exchange file format
Exchange Structure. ISO 10303-21 defines the encoding mechanism for representing data conforming to a particular schema in the EXPRESS data modeling language
ISO_10303-21
COMPRESSED DATA-STRUCTURE
COMPRESSED DATA-STRUCTURE
COMPRESSED DATA-STRUCTURE
COMPRESSED DATA-STRUCTURE
COMPRESSED DATA-STRUCTURE
COMPRESSED DATA-STRUCTURE
COMPRESSED DATA-STRUCTURE
COMPRESSED DATA-STRUCTURE
COMPRESSED DATA-STRUCTURE