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

Outgoing Links

Predicate Object
assignee http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_068275f49351e6208ce72625868f5515
http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_1f5915382b03b2e15b34f2a12cc4ceb0
classificationCPCInventive http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F17-30575
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-245
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L67-141
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F17-30483
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F17-30371
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-27
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L67-1095
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-2365
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-24553
classificationIPCInventive http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F17-30
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04L29-08
filingDate 2017-11-20-04:00^^<http://www.w3.org/2001/XMLSchema#date>
inventor http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_97ae3aaf53e759878143141135147265
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_c867e241028904ee8f2b6d8aefcef9f6
publicationDate 2018-03-15-04:00^^<http://www.w3.org/2001/XMLSchema#date>
publicationNumber US-2018075122-A1
titleOfInvention Method to Federate Data Replication over a Communications Network
abstract A method and system enable acceleration of high performance data replication over an Internet connection by means of parallel processes. Scalability of data replication is enhanced both by means of parallel queries as subtasks of a main controller, and by wrapping the queries in date time stamp-bounded ranges, requesting only records falling within the specific times indicated by the date time stamp. By wrapping the queries, the number of records per pass is limited, enhancing the efficiency of each pass. The reduced number of records per pass further facilitates re-initiation of data replication upon failure, because fewer records are less burdensome for a computing system to attempt to transmit and/or receive multiple times. Also presented is a method by which a client may query a remote server for record keys, in place of full records, such that the client and server need process less data.
isCitedBy http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-11610012-B1
priorityDate 2015-04-06-04:00^^<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-2013042083-A1
isDiscussedBy http://rdf.ncbi.nlm.nih.gov/pubchem/anatomy/ANATOMYID37610
http://rdf.ncbi.nlm.nih.gov/pubchem/taxonomy/TAXID36181
http://rdf.ncbi.nlm.nih.gov/pubchem/taxonomy/TAXID37610
http://rdf.ncbi.nlm.nih.gov/pubchem/anatomy/ANATOMYID36181
http://rdf.ncbi.nlm.nih.gov/pubchem/anatomy/ANATOMYID370703
http://rdf.ncbi.nlm.nih.gov/pubchem/compound/CID23672308
http://rdf.ncbi.nlm.nih.gov/pubchem/taxonomy/TAXID370703
http://rdf.ncbi.nlm.nih.gov/pubchem/substance/SID450648134

Total number of triples: 32.