The patent's inventor is Leshchiner, Dan (
This patent was filed on
From the background information supplied by the inventors, news correspondents obtained the following quote: "Typical servers and communication systems do not provide efficient implementations to limit or decrease the size of transmissions, which may cause the network to become congested. Typically, all of the information of a transmission is necessarily passed through the network. Without data compression, expensive resources are continuously consumed with every message, including storage space and transmission bandwidth. Bitmasks or other methods may be used to decrease the size of messages sent in transmissions, but bitmasks have overhead that increases the size of each compressed message. The additional size of bitmasks appended to each message may consume expensive resources and negatively affect communication speed. The need has arisen to provide a method and system for compressing the bitmasks associated with messages to address the issues of consuming expensive resources, communication speed, and network congestion."
Supplementing the background information on this patent, VerticalNews reporters also obtained the inventor's summary information for this patent: "According to an aspect of this disclosure, systems are described for compressing and decompressing bitmasks. The systems may also include a sender machine and a receiver machine for compressing, sending, receiving, and decompressing the bitmask across a network or data pipeline.
"According to another aspect of this disclosure, methods are described for compressing bitmasks and decompressing bitmasks. The methods may include building a representative tree and traversing the representative tree using a bitmask of n-bits. The methods may further include creating nodes at a first level for a number of bits in the bitmask and aligning the nodes in a certain level of the representative tree while retaining the original left-to-right ordering of the bits in the bitmask. The methods may further include creating a parent level based on the first level or creating a new parent level based on the parent level, etc.
"The methods may further include creating an empty buffer and traversing the tree. For each non-zero node in the tree, the value of the node is appended to the buffer. The methods may further include optimizing a compressed bitmask by minimizing the number of bits used to represent strings of zeros, inverting a bitmask to convert a dense bitmask to a sparse intermediate bitmask, and/or inverting the compression and decompression algorithms to compress and decompress strings of ones rather than zeros. Methods may further include ordering fields of the bitmask to group zero fields together.
"According to another aspect of this disclosure, methods are disclosed for decompressing a bitmask. The methods may include traversing compressed bitmask copying leaf nodes and reconstructing interleaving runs of zeros by deducing zero sub-trees."
For the URL and additional information on this patent, see: Leshchiner, Dan. Hierarchical Bitmasks for Indicating the Presence Or Absence of Serialized Data Fields. U.S. Patent Number 8751671, filed
Keywords for this news article include:
Our reports deliver fact-based news of research and discoveries from around the world. Copyright 2014, NewsRx LLC
Most Popular Stories
- GE Healthcare Bringing Jobs to Massachusetts
- Apple Stock Bounces Back Big Time
- Faith Groups Divest From Fossil Fuels
- Spiders Get Bigger, Reproduce Faster in Cities
- James Foley Beheading Video Is Real Thing: White House
- Entrepreneur Contest Announced in Idaho
- Why BofA Won't Pay $17 Billion After All
- Notes From the July FOMC Meeting
- Obama Weighs Move on Legal Immigration
- Eric Holder Arrives in Ferguson