http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-2010254580-A1

Outgoing Links

Predicate Object
assignee http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_dac64077e04d62194bd2ee7f4ec32f56
classificationCPCInventive http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H03M7-30
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L69-04
classificationIPCInventive http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06K9-62
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F15-16
filingDate 2010-05-26^^<http://www.w3.org/2001/XMLSchema#date>
inventor http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_c9b4c021a62e0a5102c3b63c4a2904c4
publicationDate 2010-10-07^^<http://www.w3.org/2001/XMLSchema#date>
publicationNumber US-2010254580-A1
titleOfInvention Systems and methods for identifying long matches of data in a compression history
abstract Systems and methods of storing previously transmitted data and using it to reduce bandwidth usage and accelerate future communications are described. By using algorithms to identify long compression history matches, a network device may improve compression efficiently and speed. A network device may also use application specific parsing to improve the length and number of compression history matches. Further, by sharing compression histories, compression history indexes and caches across multiple devices, devices can utilize data previously transmitted to other devices to compress network traffic. Any combination of the systems and methods may be used to efficiently find long matches to stored data, synchronize the storage of previously sent data, and share previously sent data among one or more other devices.
isCitedBy http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-8335853-B2
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-9025475-B1
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-2016055227-A1
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-8812609-B2
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-2011153834-A1
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-10606865-B2
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/WO-2013072765-A3
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/WO-2013072765-A2
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-2012311062-A1
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-9754008-B2
priorityDate 2007-03-12^^<http://www.w3.org/2001/XMLSchema#date>
type http://data.epo.org/linked-data/def/patent/Publication

Incoming Links

Predicate Subject
isCitedBy http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-6721713-B1
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-7532134-B2
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-6529948-B1
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-6400996-B1
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-7207485-B2
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-6550057-B1
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-7197374-B2
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-7006881-B1
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-6850252-B1
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-6536037-B1
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-6742015-B1
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-7159777-B2
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-6519571-B1
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-6539396-B1
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-6529909-B1
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-6571282-B1
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-6715145-B1
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-7207483-B2
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-7178719-B2
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-6549949-B1
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-6339832-B1
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-6578068-B1
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-6842906-B1
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-7167844-B1
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-7165041-B1
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-7188769-B2
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-7175089-B2
isDiscussedBy http://rdf.ncbi.nlm.nih.gov/pubchem/substance/SID129054369
http://rdf.ncbi.nlm.nih.gov/pubchem/compound/CID3396

Showing number of triples: 1 to 52 of 52.