Systems, methods, and apparatuses for scanning a legacy database

Information

  • Patent Grant
  • 11514021
  • Patent Number
    11,514,021
  • Date Filed
    Friday, January 22, 2021
    4 years ago
  • Date Issued
    Tuesday, November 29, 2022
    2 years ago
  • Inventors
    • Bailey; Bruce (Portland, OR, US)
    • Helzer; Mark (Portland, OR, US)
  • Original Assignees
  • Examiners
    • Tran; Anhtai V
    Agents
    • Stoel Rives LLP
  • CPC
    • G06F16/2358
    • G06F16/219
    • G06F16/2322
    • G06F16/25
    • G06F16/289
  • Field of Search
    • CPC
    • H04L45/02
    • H04L45/04
    • H04L45/48
    • H04L49/15
  • International Classifications
    • G06F16/00
    • G06F16/23
    • G06F16/25
    • G06F16/21
    • G06F16/28
    • Term Extension
      11
Abstract
Embodiments herein relate to replacing a legacy Pick environment with a modern microservice architecture. A legacy database and a modern database may be operated in parallel for data validation. Part of the data validation may include scanning the legacy database for updates to items stored thereon. Embodiments herein may generate an update message by combining item keys from across the multiple files that correspond with a same business object.
Description
TECHNICAL FIELD

The present disclosure relates generally to data validation when replacing a database. More specifically, the present disclosure relates to methods, systems, and apparatuses for detecting updates to records in a legacy database that is running in parallel with a modern database.





BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

To easily identify the discussion of any particular element or act, the most significant digit or digits in a reference number refer to the figure number in which that element is first introduced.



FIG. 1 illustrates a block diagram of a data system transitioning from a dealer management system to a microservice system in accordance with one embodiment.



FIG. 2 illustrates a signal flow diagram for scanning a dealer management system for updates in accordance with one embodiment.



FIG. 3 illustrates a method for scanning for updates in a legacy database system in accordance with one embodiment.



FIG. 4 is a block diagram of an update scanner in accordance with one embodiment.





DETAILED DESCRIPTION

Described herein are embodiments of systems, apparatuses, and methods for data validation when replacing a database. A system may periodically request updates to records in a legacy database that is running in parallel with a modern database. The system may convert the legacy database records into update messages that are more efficient for the modern database to use for data validation.


Businesses occasionally replace and modernize their database environments. Often the move from a legacy database environment to a modern database environment involves moving between two different incompatible data architectures. Additionally, there is often a desire to gradually transition between the legacy database and the modern database to allow for data validation of the modern database while allowing applications to take advantage of the modern database. To provide data validation in some embodiments the two databases may be run in parallel and a validation system may compare updates to records in the legacy database against updates to the modern database. However, because the databases have different data architectures, comparing the updates may be inefficient.


One of the challenges of the transition between databases is handling the large number of updates to the legacy database. To address this challenge, embodiments below include a scanner service that are configured to scan and recognize business objects across the multiple records of the legacy database. The scanner service may use a timestamp associated with each update to the records in the legacy database to check for updates to the legacy data. The scanner service may filter out updates that are not part of a business object as well as combine separate components that together comprise a business object. The scanner service may provide an update message with the filtered and combined results.


Specific embodiments herein relate to replacing a legacy Pick environment with a modern microservice architecture. While movement between a Pick environment and a modern microservice architecture is discussed herein, embodiments herein may also be applied to transitioning between other database types.


The phrases “coupled to,” “connected to,” and “in communication with” refer to any form of interaction between two or more components, including mechanical, electrical, magnetic, and electromagnetic interaction. Two components may be connected to each other, even though they are not in direct contact with each other, and even though there may be intermediary devices between the two components.


It will be readily understood that the components of the embodiments as generally described below and illustrated in the Figures herein could be arranged and designed in a wide variety of different configurations. For instance, the steps of a method do not necessarily need to be executed in any specific order, or even sequentially, nor do the steps need to be executed only once. Thus, the following more detailed description of various embodiments, as described below and represented in the Figures, is not intended to limit the scope of the disclosure but is merely representative of various embodiments. While the various aspects of the embodiments are presented in the drawings, the drawings are not necessarily drawn to scale unless specifically indicated.


Embodiments and implementations of systems and methods described herein may include various steps, which may be embodied in machine-executable instructions to be executed by a computer system. A computer system may include one or more general-purpose or special-purpose computers (or other electronic devices). The computer system may include hardware components that include specific logic for performing the steps or may include a combination of hardware, software, and/or firmware.


Embodiments may be provided as a computer program product including a computer-readable medium having stored thereon instructions that may be used to program a computer system or other electronic device to perform the processes described herein. The computer-readable medium may include, but is not limited to: hard drives, floppy diskettes, optical disks, CD-ROMs, DVD-ROMs, ROMs, RAMs, EPROMs, EEPROMs, magnetic or optical cards, solid-state memory devices, or other types of media/computer-readable media suitable for storing electronic instructions.


Computer systems and the computers in a computer system may be connected via a network. Suitable networks for configuration and/or use as described herein include one or more local area networks, wide area networks, metropolitan area networks, and/or Internet or Internet Protocol (IP) networks, such as the World Wide Web, a private Internet, a secure Internet, a value-added network, a virtual private network, an extranet, an intranet, or even stand-alone machines that communicate with other machines by physical transport of media. In particular, a suitable network may be formed from parts or entireties of two or more other networks, including networks using disparate hardware and network communication technologies.


One suitable network includes a server and several clients; other suitable networks may contain other combinations of servers, clients, and/or peer-to-peer nodes, and a given computer system may function both as a client and as a server. Each network includes at least two computers or computer systems, such as the server and/or clients. A computer system may include a workstation, laptop computer, mobile computer, server, mainframe, cluster, so-called “network computer” or “thin client,” tablet, smart phone, personal digital assistant or other hand-held computing device, “smart” consumer electronics device or appliance, medical device, or combination thereof.


Suitable networks may include communications or networking software, such as the software available from Novell®, Microsoft®, and other vendors, and may operate using Transfer Control Protocol (TCP)/IP, SPX, IPX, and other protocols over twisted pair, coaxial, or optical fiber cables; telephone lines; radio waves; satellites; microwave relays; modulated AC power lines; physical media transfer; and/or other data transmission “wires” known to those of skill in the art. The network may encompass smaller networks and/or be connectable to other networks through a gateway or similar mechanism.


Each computer system includes one or more processors and/or memory; computer systems may also include various input devices and/or output devices. The processor may include a general-purpose device, such as an Intel®, AMD®, or other “off-the-shelf” microprocessor. The processor may include a special-purpose processing device, such as an ASIC, SoC, SiP, FPGA, PAL, PLA, FPLA, PLD, or other customized or programmable device. The memory may include static RAM, dynamic RAM, flash memory, one or more flip-flops, ROM, CD-ROM, disk, tape, magnetic, optical, or other computer storage medium. The input device(s) may include a keyboard, mouse, touch screen, light pen, tablet, microphone, sensor, or other hardware with accompanying firmware and/or software. The output device(s) may include a monitor or other display, printer, speech or text synthesizer, switch, signal line, or other hardware with accompanying firmware and/or software.


The computer systems may be capable of using a floppy drive, a tape drive, an optical drive, a magneto-optical drive, or other means to read a storage medium. A suitable storage medium includes a magnetic, an optical, or other computer-readable storage device having a specific physical configuration. Suitable storage devices include floppy disks, hard disks, tape, CD-ROMs, DVDs, PROMs, RAM, flash memory, and other computer system storage devices. The physical configuration represents data and instructions that cause the computer system to operate in a specific and predefined manner as described herein.


Suitable software to assist in implementing the invention is readily provided by those of skill in the pertinent art(s) using the teachings presented here and programming languages and tools, such as Modern Fortran, Java, Pascal, C++, C, PHP, .Net, database languages, APIs, SDKs, assembly, firmware, microcode, and/or other languages and tools. Suitable signal formats may be embodied in analog or digital form, with or without error detection and/or correction bits, packet headers, network addresses in a specific format, and/or other supporting data readily provided by those of skill in the pertinent art(s).


Aspects of certain embodiments may be implemented as software modules or components. As used herein, a software module or component may include any type of computer instruction or computer executable code located within or on a computer-readable storage medium. A software module may, for instance, comprise one or more physical or logical blocks of computer instructions, which may be organized as a routine, a program, an object, a component, a data structure, etc. that performs one or more tasks or implement particular abstract data types. A particular software module may comprise disparate instructions stored in different locations of a computer-readable storage medium, which together implement the described functionality of the module. Indeed, a module may comprise a single instruction or many instructions, and may be distributed over several different code segments, among different programs, and across several computer-readable storage media.


Some embodiments may be practiced in a distributed computing environment where tasks are performed by a remote processing device linked through a communications network. In a distributed computing environment, software modules may be located in local and/or remote computer-readable storage media. In addition, data being tied or rendered together in a database record may be resident in the same computer-readable storage medium, or across several computer-readable storage media, and may be linked together in fields of a record in a database across a network. According to one embodiment, a database management system (DBMS) allows users to interact with one or more databases and provides access to the data contained in the databases.



FIG. 1 illustrates a block diagram of a data system 100 transitioning from a dealer management system 110 to a microservice system 112. As shown, the data system 100 may operate two databases in parallel during a transition from a legacy database (e.g., dealer management system 110) to a modern database (e.g., microservice system 112).


Running the two databases in parallels may allow for a gradual rollout of the new architecture in a way that permits data validation and allows older applications to take advantage of the new environment. For example, an application running on a computing device 108 may have been developed for the legacy dealer management system 110. To upgrade to the microservice system 112 it may be desirous to have the application access both the microservice system 112 and the dealer management system 110 in parallel and track the changes in the dealer management system 110 in comparison to the microservice system 112 to validate that all of the changes to data in the dealer management system 110 are being captured by the microservice system 112.


For example, a business may desire to replace a legacy Pick environment (e.g., dealer management system 110) with a modern microservice architecture. A Pick environment includes an operating system for databases that was developed decades ago. The Pick environment has an architecture with a centralized dealer management system 110 with applications and a legacy Pick database 102. A dealer management system 110 may refer to a stand-alone computer system that hosts the legacy data and code. Each client (i.e., a user of the data system 100) may have at least one dealer management system 110 to host the client's applications and data. Occasionally a client may have more than one dealer management system 110.


The legacy software and database for the dealer management system 110 may have been developed over a long period of time. As a consequence, there may be a very large amount of messy code, messy database design, and complexity. For example, information corresponding to a specific object (e.g., customer, vendor, financial institution) controlled by the application of the computing device 108 may be spread over several data files. To further complicate matters, the data files may not be homogenous with respect to one object. For example, information corresponding to a customer may be in the same data file as information corresponding to a vendor. This unorganized and complicated set of data files may make it difficult to track changes to each object.


In contrast to the organization of the dealer management system 110, the new microservice system 112 may have a data architecture that structures an application as a collection of services 114. For example, the application controllable objects that are spread across multiple data files in the dealer management data system 100 may be ordered according to independent services 114. This change in data architecture and the complexity of the dealer management system 110 makes data validation difficult and inefficient.


To reduce the complexity and improve efficiency of data validation, an update scanner 104 may track, filter, and compile updates to information corresponding to the objects as discussed in more detail below. The update scanner 104 may send a message to a microservice database manager 106 indicating updates to records associated with the objects. Each message may contain all updates for an object to reduce the number of messages sent.



FIG. 2 illustrates a signal flow diagram for scanning a dealer management system 110 for updates according to one embodiment. In the illustrated embodiment, the dealer management system 110 belongs to a car dealership. However, a similar system may be set up for other types of clients. The dealer management system 110 comprises an update scanner 104 and a legacy Pick database 102. The update scanner 104 monitors the legacy Pick database 102 for changes and provides an update message 212 comprising a compilation of any detected changes.


The legacy Pick database 102 may comprise a plurality of data files (e.g., a name-file 202, service-names 204, and customer comments 206). Each data file may comprise a series of items or records that make up data elements of the data file. As the legacy Pick database 102 may have been developed and updated for several decades, there may be a very large amount of messy code, messy database design, and complexity that makes it difficult to completely replicate the functions of the legacy Pick database 102 on a new database system.


Accordingly, data validation may be desirous. Data validation may include determining that the updates occurring on the legacy Pick database 102 are also captured on the new database system that is running in parallel. Part of determining that the updates have occurred on both systems includes monitoring changes on the legacy Pick database 102. However, the data structure of the legacy Pick database 102 may make it difficult to track the updates to a new data structure.


For example, the new data structure may be developed around a plurality of objects. Objects, also referred to herein as business objects, may be a collection of closely related data elements, items, and/or records that represent information that a client business works with. For example, business objects may include customers, vehicles, and vehicle purchase contracts. Items related to one object may be incorporated into multiple data files on the legacy Pick database 102.


Additionally, each data file in the legacy Pick database 102 may include items related to multiple objects. Items are stored in the data files. A Pick item may correspond roughly to a record in a modern database. In other words, a Pick item may be described as a document, rather than a record. An example of a non-homogenous file may include the name-file 202. The name-file 202 may contain most of the customer business object information. However, the name-file 202 may also contains information about other business objects, such as employees, vendors, financial institutions, and more. In some embodiments, a customer item in the name-file 202 may also even contain accounts receivable amounts and aging information.


As shown, the update scanner 104 may comprise an update decipherer 210 and a sync tool 208. The update decipherer 210 may be a daemon or service that runs on the legacy system (e.g., dealer management system 110). The update decipherer 210 is configured to recognize items in the data files that comprise different business objects. The sync tool 208 may be a service that also runs on the legacy system. It may not be able to recognize business objects like the update decipherer 210, but it may be able to poll the data files and return keys to the latest updates for files. The update decipherer 210 may be able to search for Pick files, items within the Pick files, and the timestamps stored with items.


To scan for updates to the legacy Pick database 102, the update decipherer 210 may periodically request 214 the latest updates to Pick data files. The update decipherer 210 sends the request 214 to the sync tool 208. In some embodiments, the request 214 may include a uniform resource identifier (URI). The URI may identify one or more data files to be checked for updates and an indication of a desired period of time during which the updates occurred. For example, the update decipherer 210 may send a URI, such as http://localhost:10229/dbsync/v1/D100093794/NAME-FILE?sel=1565724886.475, to the sync tool 208. This example URI requests updates that have occurred in the name-file 202 since 1565724886.475. The update decipherer 210 may send additional requests for other files that contain a business object (e.g., customer information) that the update decipherer 210 is gathering updates for.


The sync tool 208 receives the request and may extract 216 the updated item keys from the data files in the specified time range. The item keys may comprise an item identifier and a timestamp of a last update. The sync tool 208 may return 218 keys corresponding to updates for the data files requested by the update decipherer 210. An example below shows a sample return document that the sync tool 208 may send to the update decipherer 210. The sample return document indicates that items “4*9014” and “4*11341” have been updated in the requested range. In some embodiments, microsecond precise timestamp can be included in the return document.




















<?xml version=″1.0″ encoding=″ISO-8859-1″?>





<response>





 <pickdata>





  <requestparams>





   <accountname>TEST-A</accountname>





   <timerangebegin>1603192353.0</timerangebegin>





   <timerangeend>unspecified</timerangeend>





   <file>NAME-FILE</file>





   <dictrequested>false</dictrequested>





  </requestparams>





  <item>





   <id>4*9014</id>





   <ts>1603193254.561832</ts>





  </item>





  <item>





   <id>4*11341</id>





   <ts>1603194551.481608</ts>





  </item>





 </pickdata>





</response>










The update decipherer 210 may assemble the item keys associated with a business object into an update message 212. To assemble the update message 212, the update decipherer 210 may combine information from multiple data files such as the name-file 202, service-names 204, and customer comments 206. The update decipherer 210 may ignore content from the item keys returned by the sync tool 208 that do not relate to the business object that the update decipherer 210 is compiling the update message 212 for. The update decipherer 210 may generate an update message 212 for customer business objects, vehicle business objects, and vehicle purchase contract business objects. In some embodiments, each update message 212 may include all updates to a single business object during the identified time period. The update decipherer 210 may convert the data that it has compiled into JSON messages for the update message 212. The messages may include one message per customer update. That is, for each customer business object, the update decipherer 210 may send one message.


The update decipherer 210 may send 220 the update message 212 to the modern database system for data verification. In some embodiments, the update message 212 may use Kafka messaging to send information from the legacy system to the new microservice system. In some embodiments, the message may comprise the item keys and update time stamp. For example, the message may look like the following example.




















{





 ″domain″ : ″Customer″,





 ″enterprise_id″ : ″E207187″,





 ″keys″ : [





  {





   ″depts″ : [ ″D100093794″ ],





   ″id″ : ″9014″,





   ″timestamp″ : ″1603193254.561832″,





   ″type″ : ″4″





  }





 ],





 ″store_id″ : ″S100023739″





}











FIG. 3 illustrates a method 300 for scanning for updates in a legacy database system in accordance with one embodiment. The method 300 may be performed by an update scanning system such as the update scanner 104 in FIG. 1. The legacy database may be a Pick environment and the modern database modern microservice architecture.


As shown, a system using the method 300 may request 302 update information for multiple files on the legacy database for a specified time range. The method 300 may further request 214 item keys for items that were updated within the multiple files during the specified time range. The item keys may comprise an item identifier and a timestamp of a last update of the item. The items may be data elements within data files of the legacy database.


The system using the method 300 may receive 304 and process the item keys for items that were updated within the multiple files during the specified time range. To process the item keys, the system may filter 306 item keys based on which business object each item corresponds to. For example, the system may separate items related to customer business objects, employee business objects, vendor business objects, and financial institution business objects. In some embodiments, the data files may not be homogenous with respect to business object content. Thus, the system may need to search multiple data files to find item keys related to each of the business objects.


The system using the method 300 may combine 308 item keys from across the multiple files that correspond with a same business object. The system may assemble or compile these keys into a JSON message to generate 310 an update message. The system may send 312 the update message to the modern database. Additional update messages may be generated for additional business objects, and each update message may comprise all of the item keys associated with a corresponding business object during the specified time range. In some embodiments, the update message comprises a single notification for all updates associated with a same customer account.



FIG. 4 is a block diagram of an update scanner 400 according to one embodiment. The update scanner 400 may perform the methods and use the techniques described with reference to the other Figures in the specification. The update scanner 400 can include a memory 403, one or more processors 404, a network interface 406, an input/output interface 408, and a system bus 409.


The one or more processors 404 may include one or more general-purpose devices, such as an Intel®, AMD®, or other standard microprocessor. The one or more processors 404 may include a special-purpose processing device, such as ASIC, SoC, SiP, FPGA, PAL, PLA, FPLA, PLD, or other customized or programmable device. The one or more processors 404 can perform distributed (e.g., parallel) processing to execute or otherwise implement functionalities of the presently disclosed embodiments. The one or more processors 404 may run a standard operating system and perform standard operating system functions. It is recognized that any standard operating systems may be used, such as, for example, Microsoft® Windows®, Apple® MacOS®, Disk Operating System (DOS), UNIX, IRJX, Solaris, SunOS, FreeBSD, Linux®, ffiM® OS/2® operating systems, and so forth.


The memory 403 may include static RAM, dynamic RAM, flash memory, one or more flip-flops, ROM, CD-ROM, DVD, disk, tape, or magnetic, optical, or other computer storage medium. The memory 403 may include a plurality of program modules 410 and program data 420. The memory 403 may be local to the update scanner 400, as shown, or may be distributed and/or remote relative to the update scanner 400.


Data generated or used by the update scanner 400, such as by the program modules 410 or other modules, may be stored on the memory 403, for example, as stored program data 420. The data 420 may be organized as one or more databases. The data 420 may include item keys 422. The item keys 422 may comprise an item identifier and a timestamp of a last update if the item. The items may be data elements within data files of the legacy database.


The program modules 410 may run multiple operations concurrently or in parallel by or on the one or more processors 404. In some embodiments, portions of the disclosed modules, components, and/or facilities are embodied as executable instructions embodied in hardware or firmware, or stored on a non-transitory, machine-readable storage medium. The executable instructions may comprise computer program code that, when executed by a processor and/or computing device, cause a computing system to implement certain processing steps, procedures, and/or operations, as disclosed herein. The modules, components, and/or facilities disclosed herein may be implemented and/or embodied as a driver, a library, an interface, an API, FPGA configuration data, firmware (e.g., stored on an EEPROM), and/or the like. In some embodiments, portions of the modules, components, and/or facilities disclosed herein are embodied as machine components, such as general and/or application-specific devices, including, but not limited to: circuits, integrated circuits, processing components, interface components, hardware controller(s), storage controller(s), programmable hardware, FPGAs, ASICs, and/or the like. Accordingly, the modules disclosed herein may be referred to as controllers, layers, services, engines, facilities, drivers, circuits, subsystems, and/or the like.


The modules 410 may comprise a requesting tool 412, a filter 414, an assembler 416, and a message generator 418. The requesting tool 412 may request update information for multiple files on the legacy database for a specified time range. The filter 414 may filter the item keys 422 based on which business object each item corresponds to. The assembler may combine the item keys 422 related to a same business object. The item keys 422 may be from across the multiple files. The message generator 418 may generate an update message that may be sent to the modern database.


The input/output interface 408 may facilitate user interaction with one or more input devices and/or one or more output devices. The input device(s) may include a keyboard, mouse, touchscreen, light pen, tablet, microphone, sensor, or other hardware with accompanying firmware and/or software. The output device(s) may include a monitor or other display, printer, speech or text synthesizer, switch, signal line, or other hardware with accompanying firmware and/or software. For example, in one embodiment, the input/output interface 408 comprises a display to provide a graphical user interface (GUI) illustrating the potential ablation perimeters. The input/output interface 408 can receive user input data. In some embodiments, the input/output interface 408 is a touchscreen, and the size input is received via the touchscreen. In some embodiments, the input/output interface 408 can superimpose the target ablation perimeters on an image of the tissue.


The network interface 406 may facilitate communication with other computing devices and/or networks and/or other computing and/or communications networks. The network interface 406 may be equipped with conventional network connectivity, such as, for example, Ethernet (IEEE 1102.3), Token Ring (IEEE 1102.5), Fiber Distributed Datalink Interface (FDDI), or Asynchronous Transfer Mode (ATM). Further, the network interface 406 may be configured to support a variety of network protocols such as, for example, IP, TCP, Network File System over UDP/TCP, Server Message Block (SMB), Microsoft® Common Internet File System (CIFS), Hypertext Transfer Protocols (HTTP), Direct Access File System (DAFS), File Transfer Protocol (FTP), Real-Time Publish Subscribe (RTPS), Open Systems Interconnection (OSI) protocols, Simple Mail Transfer Protocol (SMTP), Secure Shell (SSH), Secure Socket Layer (SSL), and so forth.


The system bus 409 may facilitate communication and/or interaction between the other components of the update scanner 400, including the one or more processors 404, the memory 403, the input/output interface 408, and the network interface 406.


Any methods disclosed herein comprise one or more steps or actions for performing the described method. The method steps and/or actions may be interchanged with one another. In other words, unless a specific order of steps or actions is required for proper operation of the embodiment, the order and/or use of specific steps and/or actions may be modified.


While specific embodiments of stents have been illustrated and described, it is to be understood that the disclosure provided is not limited to the precise configuration and components disclosed. Various modifications, changes, and variations apparent to those of skill in the art having the benefit of this disclosure may be made in the arrangement, operation, and details of the methods and systems disclosed, with the aid of the present disclosure.


Without further elaboration, it is believed that one skilled in the art can use the preceding description to utilize the present disclosure to its fullest extent. The examples and embodiments disclosed herein are to be construed as merely illustrative and exemplary and not a limitation of the scope of the present disclosure in any way. It will be apparent to those having skill in the art and the benefit of this disclosure that changes may be made to the details of the above-described embodiments without departing from the underlying principles of the disclosure herein.

Claims
  • 1. A method for tracking updates to a legacy database, the method comprising: operating a legacy database and a modern database in parallel;requesting update information for multiple files on the legacy database for a specified time range;receiving item keys for items that were updated within the multiple files during the specified time range;filtering each of the item keys based at least on their associated business item and generating an update message by combining item keys from across the multiple files that correspond with a same business object and ignoring item keys not associated with the same business object;sending the update message to the modern database; andbased on receipt of the update message, performing data validation at the modern database, wherein data validation comprises determining the updates to the legacy database are captured on the modern database operating in parallel.
  • 2. The method of claim 1, wherein the legacy database is a Pick environment and the modern database is a modern microservice architecture.
  • 3. The method of claim 1, wherein additional update messages are generated for additional business objects, and wherein each update message comprises all of the item keys associated with a corresponding business object during the specified time range.
  • 4. The method of claim 1, wherein the item keys comprise an item identifier and a timestamp of a last update.
  • 5. The method of claim 1, wherein the business objects comprise customer business objects, employee business objects, vendor business objects, and financial institution business objects.
  • 6. The method of claim 1, wherein the files are not homogenous with respect to business object content.
  • 7. The method of claim 1, wherein the update message comprises a single notification for all updates associated with a same customer account.
  • 8. A computing apparatus comprising: a processor; anda memory storing instructions that, when executed by the processor, configure the apparatus to: request update information for multiple files on a legacy database for a specified time range, wherein the legacy database is operating in parallel with a modern database in parallel;receive item keys for items that were updated within the multiple files during the specified time range;filter each of the item keys based at least on their associated business item and generate an update message by combining item keys from across the multiple files that correspond with a same business object and ignoring item keys associated with the same business object;send the update message to the modern database; andbased on the update message, perform data validation at the modern database to determine the updated item keys for the multiple files on the legacy database are captured on the modern database operating in parallel.
  • 9. The computing apparatus of claim 8, wherein the legacy database is a Pick environment and the modern database is a modern microservice architecture.
  • 10. The computing apparatus of claim 8, wherein additional update messages are generated for additional business objects, and wherein each update message comprises all of the item keys associated with a corresponding business object during the specified time range.
  • 11. The computing apparatus of claim 8, wherein the item keys comprise an item identifier and a timestamp of a last update.
  • 12. The computing apparatus of claim 8, wherein the business objects comprise customer business objects, employee business objects, vendor business objects, and financial institution business objects.
  • 13. The computing apparatus of claim 8, wherein the files are not homogenous with respect to business object content.
  • 14. The computing apparatus of claim 8, wherein the update message comprises a single notification for all updates associated with a same customer account.
  • 15. A non-transitory computer-readable storage medium, the computer-readable storage medium including instructions that when executed by a computer, cause the computer to: request update information for multiple files on a legacy database for a specified time range, wherein the legacy database is operating in parallel with a modern database in parallel;receive item keys for items that were updated within the multiple files during the specified time range;filter each of the item keys based at least on their associated business item and generate an update message by combining item keys from across the multiple files that correspond with a same business object and ignoring item keys associated with the same business object;send the update message to the modern database; andbased on receipt of the update message, perform data validation at the modern database comprising determining updated item keys for the multiple files on the legacy database are captured on the modern database operating in parallel.
  • 16. The computer-readable storage medium of claim 15, wherein the legacy database is a Pick environment and the modern database is a modern microservice architecture.
  • 17. The computer-readable storage medium of claim 15, wherein additional update messages are generated for additional business objects, and wherein each update message comprises all of the item keys associated with a corresponding business object during the specified time range.
  • 18. The computer-readable storage medium of claim 15, wherein the item keys comprise an item identifier and a timestamp of a last update.
  • 19. The computer-readable storage medium of claim 15, wherein the files are not homogenous with respect to business object content.
  • 20. The computer-readable storage medium of claim 15, wherein the update message comprises a single notification for all updates associated with a same customer account.
US Referenced Citations (522)
Number Name Date Kind
3792445 Bucks et al. Feb 1974 A
4258421 Juhasz et al. Mar 1981 A
4992940 Dworkin Feb 1991 A
5003476 Abe Mar 1991 A
5034889 Abe Jul 1991 A
5058044 Stewart et al. Oct 1991 A
5421015 Khoyi et al. May 1995 A
5442553 Parrillo Aug 1995 A
5452446 Johnson Sep 1995 A
5521815 Rose, Jr. May 1996 A
5649186 Ferguson Jul 1997 A
5694595 Jacobs et al. Dec 1997 A
5729452 Smith et al. Mar 1998 A
5764943 Wechsler Jun 1998 A
5787177 Leppek Jul 1998 A
5790785 Klug et al. Aug 1998 A
5835712 Dufresne Nov 1998 A
5845299 Arora et al. Dec 1998 A
5862346 Kley et al. Jan 1999 A
5911145 Arora et al. Jun 1999 A
5956720 Fernandez et al. Sep 1999 A
5974149 Leppek Oct 1999 A
5974418 Blinn et al. Oct 1999 A
5974428 Gerard et al. Oct 1999 A
5978776 Seretti et al. Nov 1999 A
5987506 Carter et al. Nov 1999 A
6003635 Bantz et al. Dec 1999 A
6006201 Berent et al. Dec 1999 A
6009410 Lemole et al. Dec 1999 A
6018748 Smith Jan 2000 A
6021416 Dauerer et al. Feb 2000 A
6021426 Douglis et al. Feb 2000 A
6026433 D'Arlach et al. Feb 2000 A
6041310 Green et al. Mar 2000 A
6041344 Bodamer et al. Mar 2000 A
6055541 Solecki et al. Apr 2000 A
6061698 Chadha et al. May 2000 A
6067559 Allard et al. May 2000 A
6070164 Vagnozzi May 2000 A
6134532 Lazarus et al. Oct 2000 A
6151609 Truong Nov 2000 A
6178432 Cook et al. Jan 2001 B1
6181994 Colson et al. Jan 2001 B1
6185614 Cuomo et al. Feb 2001 B1
6189104 Leppek Feb 2001 B1
6216129 Eldering Apr 2001 B1
6219667 Lu et al. Apr 2001 B1
6236994 Schwartz et al. May 2001 B1
6240365 Bunn May 2001 B1
6263268 Nathanson Jul 2001 B1
6285932 De Belledeuille et al. Sep 2001 B1
6289382 Bowman-Amuah Sep 2001 B1
6295061 Park et al. Sep 2001 B1
6330499 Chou et al. Dec 2001 B1
6343302 Graham Jan 2002 B1
6353824 Boguraev et al. Mar 2002 B1
6356822 Diaz et al. Mar 2002 B1
6374241 Lamburt et al. Apr 2002 B1
6397226 Sage May 2002 B1
6397336 Leppek May 2002 B2
6401103 Ho et al. Jun 2002 B1
6421733 Tso et al. Jul 2002 B1
6473849 Keller et al. Oct 2002 B1
6496855 Hunt et al. Dec 2002 B1
6505106 Lawrence et al. Jan 2003 B1
6505205 Kothuri et al. Jan 2003 B1
6519617 Wanderski et al. Feb 2003 B1
6529948 Bowman-Amuah Mar 2003 B1
6535879 Behera Mar 2003 B1
6539370 Chang et al. Mar 2003 B1
6546216 Mizoguchi et al. Apr 2003 B2
6553373 Boguraev et al. Apr 2003 B2
6556904 Larson et al. Apr 2003 B1
6564216 Waters May 2003 B2
6571253 Thompson et al. May 2003 B1
6581061 Graham Jun 2003 B2
6583794 Wattenberg Jun 2003 B1
6594664 Estrada et al. Jul 2003 B1
6606525 Muthuswamy et al. Aug 2003 B1
6629148 Ahmed et al. Sep 2003 B1
6640244 Bowman-Amuah Oct 2003 B1
6643663 Dabney et al. Nov 2003 B1
6654726 Hanzek Nov 2003 B1
6678706 Fishel Jan 2004 B1
6697825 Underwood et al. Feb 2004 B1
6701232 Yamaki Mar 2004 B2
6721747 Lipkin Apr 2004 B2
6728685 Ahluwalia Apr 2004 B1
6738750 Stone et al. May 2004 B2
6744735 Nakaguro Jun 2004 B1
6748305 Klausner et al. Jun 2004 B1
6785864 Te et al. Aug 2004 B1
6795819 Wheeler et al. Sep 2004 B2
6823258 Ukai et al. Nov 2004 B2
6823359 Heidingsfeld Nov 2004 B1
6826594 Pettersen Nov 2004 B1
6847988 Toyouchi et al. Jan 2005 B2
6850823 Eun et al. Feb 2005 B2
6871216 Miller et al. Mar 2005 B2
6901430 Smith Mar 2005 B1
6894601 Grunden et al. May 2005 B1
6917941 Wight et al. Jul 2005 B2
6922674 Nelson Jul 2005 B1
6941203 Chen Sep 2005 B2
6944677 Zhao Sep 2005 B1
6954731 Montague et al. Oct 2005 B1
6963854 Boyd et al. Nov 2005 B1
6965806 Eryurek et al. Nov 2005 B2
6965968 Touboul Nov 2005 B1
6978273 Bonneau et al. Dec 2005 B1
6981028 Rawat et al. Dec 2005 B1
6990629 Heaney et al. Jan 2006 B1
6993421 Pillar Jan 2006 B2
7000184 Matveyenko et al. Feb 2006 B2
7003476 Samra et al. Feb 2006 B1
7010495 Samra et al. Mar 2006 B1
7028072 Kliger et al. Apr 2006 B1
7031554 Iwane Apr 2006 B2
7039704 Davis et al. May 2006 B2
7047318 Svedloff May 2006 B1
7062343 Ogushi et al. Jun 2006 B2
7062506 Taylor et al. Jun 2006 B2
7072943 Landesmann Jul 2006 B2
7092803 Kapolka et al. Aug 2006 B2
7107268 Zawadzki et al. Sep 2006 B1
7124116 Huyler Oct 2006 B2
7152207 Underwood et al. Dec 2006 B1
7155491 Schultz et al. Dec 2006 B1
7171418 Blessin Jan 2007 B2
7184866 Squires et al. Feb 2007 B2
7197764 Cichowlas Mar 2007 B2
7219234 Ashland et al. May 2007 B1
7240125 Fleming Jul 2007 B2
7246263 Skingle Jul 2007 B2
7281029 Rawat Oct 2007 B2
7287000 Boyd et al. Oct 2007 B2
7322007 Schowtka et al. Jan 2008 B2
7386786 Davis et al. Jun 2008 B2
7401289 Lachhwani et al. Jul 2008 B2
7406429 Salonen Jul 2008 B2
7433891 Haber et al. Oct 2008 B2
7457693 Olsen et al. Nov 2008 B2
7477968 Lowrey Jan 2009 B1
7480551 Lowrey et al. Jan 2009 B1
7496543 Bamford et al. Feb 2009 B1
7502672 Kolls Mar 2009 B1
7536641 Rosenstein et al. May 2009 B2
7548985 Guigui Jun 2009 B2
7587504 Adams et al. Sep 2009 B2
7590476 Shumate Sep 2009 B2
7593925 Cadiz et al. Sep 2009 B2
7593999 Nathanson Sep 2009 B2
7613627 Doyle et al. Nov 2009 B2
7620484 Chen Nov 2009 B1
7624342 Matveyenko et al. Nov 2009 B2
7657594 Banga et al. Feb 2010 B2
7664667 Ruppelt et al. Feb 2010 B1
7739007 Logsdon Jun 2010 B2
7747680 Ravikumar et al. Jun 2010 B2
7778841 Bayer et al. Aug 2010 B1
7801945 Geddes et al. Sep 2010 B1
7818380 Tamura et al. Oct 2010 B2
7861309 Spearman et al. Dec 2010 B2
7865409 Monaghan Jan 2011 B1
7870253 Muilenburg et al. Jan 2011 B2
7899701 Odom Mar 2011 B1
7908051 Oesterling Mar 2011 B2
7979506 Cole Jul 2011 B2
8010423 Bodin et al. Aug 2011 B2
8019501 Breed Sep 2011 B2
8036788 Breed Oct 2011 B2
8051159 Muilenburg et al. Nov 2011 B2
8055544 Ullman et al. Nov 2011 B2
8060274 Boss et al. Nov 2011 B2
8095403 Price Jan 2012 B2
8099308 Uyeki Jan 2012 B2
8135804 Uyeki Mar 2012 B2
8145379 Schwinke Mar 2012 B2
8190322 Lin et al. May 2012 B2
8209259 Graham, Jr. et al. Jun 2012 B2
8212667 Petite et al. Jul 2012 B2
8271473 Berg Sep 2012 B2
8271547 Taylor et al. Sep 2012 B2
8275717 Ullman et al. Sep 2012 B2
8285439 Hodges Oct 2012 B2
8296007 Swaminathan et al. Oct 2012 B2
8311905 Campbell et al. Nov 2012 B1
8355950 Colson et al. Jan 2013 B2
8407664 Moosmann et al. Mar 2013 B2
8428815 Van Engelshoven et al. Apr 2013 B2
8438310 Muilenburg et al. May 2013 B2
8448057 Sugnet May 2013 B1
8521654 Ford et al. Aug 2013 B2
8538894 Ullman et al. Sep 2013 B2
8645193 Swinson et al. Feb 2014 B2
8676638 Blair et al. Mar 2014 B1
8725341 Ogasawara May 2014 B2
8745641 Coker Jun 2014 B1
8849689 Jagannathan et al. Sep 2014 B1
8886389 Edwards et al. Nov 2014 B2
8924071 Stanek et al. Dec 2014 B2
8954222 Costantino Feb 2015 B2
8996230 Lorenz et al. Mar 2015 B2
8996235 Singh et al. Mar 2015 B2
9014908 Chen et al. Apr 2015 B2
9015059 Sims et al. Apr 2015 B2
9026304 Olsen, III et al. May 2015 B2
9047722 Kurnik et al. Jun 2015 B2
9165413 Jones et al. Oct 2015 B2
9183681 Fish Nov 2015 B2
9325650 Yalavarty et al. Apr 2016 B2
9349223 Palmer May 2016 B1
9384597 Koch et al. Jul 2016 B2
9477936 Lawson et al. Oct 2016 B2
9577866 Rogers et al. Feb 2017 B2
9596287 Rybak et al. Mar 2017 B2
9619945 Adderly et al. Apr 2017 B2
9659495 Modica et al. May 2017 B2
9706008 Rajan et al. Jul 2017 B2
9715665 Schondorf et al. Jul 2017 B2
9754304 Taira et al. Sep 2017 B2
9778045 Bang Oct 2017 B2
9836714 Lander et al. Dec 2017 B2
10032139 Adderly et al. Jul 2018 B2
10083411 Kinsey et al. Sep 2018 B2
10169607 Sheth et al. Jan 2019 B1
10229394 Davis et al. Mar 2019 B1
10448120 Bursztyn et al. Oct 2019 B1
10475256 Chowdhury et al. Nov 2019 B2
10541938 Timmerman Jan 2020 B1
10552871 Chadwick Feb 2020 B1
11117253 Oleynik Sep 2021 B2
20010005831 Lewin et al. Jun 2001 A1
20010014868 Herz et al. Aug 2001 A1
20010037332 Miller et al. Nov 2001 A1
20010039594 Park et al. Nov 2001 A1
20010054049 Maeda et al. Dec 2001 A1
20020023111 Arora et al. Feb 2002 A1
20020024537 Jones et al. Feb 2002 A1
20020026359 Long et al. Feb 2002 A1
20020032626 Dewolf et al. Mar 2002 A1
20020032701 Gao et al. Mar 2002 A1
20020042738 Srinivasan et al. Apr 2002 A1
20020046245 Hillar et al. Apr 2002 A1
20020049831 Platner et al. Apr 2002 A1
20020052778 Murphy et al. May 2002 A1
20020059260 Jas May 2002 A1
20020065698 Schick et al. May 2002 A1
20020065739 Florance et al. May 2002 A1
20020069110 Sonnenberg Jun 2002 A1
20020073080 Lipkin Jun 2002 A1
20020082978 Ghouri et al. Jun 2002 A1
20020091755 Narin Jul 2002 A1
20020107739 Schlee Aug 2002 A1
20020111727 Vanstory et al. Aug 2002 A1
20020111844 Vanstory et al. Aug 2002 A1
20020116418 Lachhwani et al. Aug 2002 A1
20020123359 Wei et al. Sep 2002 A1
20020124053 Adams et al. Sep 2002 A1
20020128728 Murakami et al. Sep 2002 A1
20020129054 Ferguson et al. Sep 2002 A1
20020133273 Lowrey et al. Sep 2002 A1
20020138331 Hosea et al. Sep 2002 A1
20020143646 Boyden et al. Oct 2002 A1
20020154146 Rodriquez et al. Oct 2002 A1
20020169851 Weathersby et al. Nov 2002 A1
20020173885 Lowrey et al. Nov 2002 A1
20020188869 Patrick Dec 2002 A1
20020196273 Krause Dec 2002 A1
20020198761 Ryan et al. Dec 2002 A1
20020198878 Baxter et al. Dec 2002 A1
20030014443 Bernstein et al. Jan 2003 A1
20030023632 Ries et al. Jan 2003 A1
20030033378 Needham et al. Feb 2003 A1
20030036832 Kokes et al. Feb 2003 A1
20030036964 Boyden et al. Feb 2003 A1
20030037263 Kamat et al. Feb 2003 A1
20030046179 Anabtawi et al. Mar 2003 A1
20030051022 Sogabe et al. Mar 2003 A1
20030055666 Roddy et al. Mar 2003 A1
20030061263 Riddle Mar 2003 A1
20030065532 Takaoka Apr 2003 A1
20030065583 Takaoka Apr 2003 A1
20030069785 Lohse Apr 2003 A1
20030069790 Kane Apr 2003 A1
20030074392 Campbell et al. Apr 2003 A1
20030095038 Dix May 2003 A1
20030101262 Godwin May 2003 A1
20030115292 Griffin et al. Jun 2003 A1
20030120502 Robb et al. Jun 2003 A1
20030145310 Thames et al. Jul 2003 A1
20030177050 Crampton et al. Sep 2003 A1
20030177175 Worley et al. Sep 2003 A1
20030225853 Wang et al. Dec 2003 A1
20030229623 Chang et al. Dec 2003 A1
20030233246 Snapp et al. Dec 2003 A1
20040012631 Skorski Jan 2004 A1
20040039646 Hacker Feb 2004 A1
20040041818 White et al. Mar 2004 A1
20040073546 Forster et al. Apr 2004 A1
20040073564 Haber et al. Apr 2004 A1
20040088228 Mercer et al. May 2004 A1
20040093243 Bodin et al. May 2004 A1
20040117046 Colle et al. Jun 2004 A1
20040122735 Meshkin et al. Jun 2004 A1
20040128320 Grove et al. Jul 2004 A1
20040139203 Graham, Jr. et al. Jul 2004 A1
20040148342 Cotte Jul 2004 A1
20040156020 Edwards Aug 2004 A1
20040163047 Nagahara et al. Aug 2004 A1
20040181464 Vanker et al. Sep 2004 A1
20040199413 Hauser et al. Oct 2004 A1
20040220863 Porter et al. Nov 2004 A1
20040225664 Casement Nov 2004 A1
20040230897 Latzel Nov 2004 A1
20040255233 Croney et al. Dec 2004 A1
20040267263 May Dec 2004 A1
20040268225 Walsh et al. Dec 2004 A1
20040268232 Tunning Dec 2004 A1
20050015491 Koeppel Jan 2005 A1
20050021197 Zimmerman et al. Jan 2005 A1
20050027611 Wharton Feb 2005 A1
20050065804 Worsham et al. Mar 2005 A1
20050096963 Myr et al. May 2005 A1
20050108112 Ellenson et al. May 2005 A1
20050108637 Sahota May 2005 A1
20050114270 Hind et al. May 2005 A1
20050114764 Gudenkauf et al. May 2005 A1
20050149398 McKay Jul 2005 A1
20050171836 Leacy Aug 2005 A1
20050176482 Raisinghani et al. Aug 2005 A1
20050187834 Painter et al. Aug 2005 A1
20050198121 Daniels et al. Sep 2005 A1
20050228736 Norman et al. Oct 2005 A1
20050256755 Chand et al. Nov 2005 A1
20050267774 Merritt et al. Dec 2005 A1
20050268282 Laird Dec 2005 A1
20050289020 Bruns et al. Dec 2005 A1
20050289599 Matsuura et al. Dec 2005 A1
20060031811 Ernst et al. Feb 2006 A1
20060059253 Goodman et al. Mar 2006 A1
20060064637 Rechterman et al. Mar 2006 A1
20060123330 Horiuchi et al. Jun 2006 A1
20060129423 Sheinson et al. Jun 2006 A1
20060129982 Doyle Jun 2006 A1
20060136105 Larson Jun 2006 A1
20060161841 Horiuchi et al. Jul 2006 A1
20060200751 Underwood et al. Sep 2006 A1
20060224447 Koningstein Oct 2006 A1
20060248442 Rosenstein et al. Nov 2006 A1
20060265355 Taylor Nov 2006 A1
20060271844 Suklikar Nov 2006 A1
20060277588 Harrington et al. Dec 2006 A1
20060282328 Gerace et al. Dec 2006 A1
20060282547 Hasha Dec 2006 A1
20070005446 Fusz et al. Jan 2007 A1
20070016486 Stone et al. Jan 2007 A1
20070027754 Collins et al. Feb 2007 A1
20070033087 Combs et al. Feb 2007 A1
20070033520 Kimzey et al. Feb 2007 A1
20070053513 Hoffberg Mar 2007 A1
20070100519 Engel May 2007 A1
20070150368 Arora et al. Jun 2007 A1
20070209011 Padmanabhuni et al. Sep 2007 A1
20070226540 Konieczny Sep 2007 A1
20070250229 Wu Oct 2007 A1
20070250327 Hedy Oct 2007 A1
20070250840 Coker et al. Oct 2007 A1
20070271154 Broudy et al. Nov 2007 A1
20070271330 Mattox et al. Nov 2007 A1
20070271389 Joshi et al. Nov 2007 A1
20070282711 Ullman et al. Dec 2007 A1
20070282712 Ullman et al. Dec 2007 A1
20070282713 Ullman et al. Dec 2007 A1
20070288413 Mizuno et al. Dec 2007 A1
20070294192 Tellefsen Dec 2007 A1
20080010561 Bay et al. Jan 2008 A1
20080015921 Libman Jan 2008 A1
20080015929 Koeppel et al. Jan 2008 A1
20080027827 Eglen et al. Jan 2008 A1
20080119983 Inbarajan et al. May 2008 A1
20080172632 Stambaugh Jul 2008 A1
20080189143 Wurster Aug 2008 A1
20080195435 Bentley et al. Aug 2008 A1
20080195932 Oikawa et al. Aug 2008 A1
20080201163 Barker et al. Aug 2008 A1
20080255925 Vailaya et al. Oct 2008 A1
20090012887 Taub et al. Jan 2009 A1
20090024918 Silverbrook et al. Jan 2009 A1
20090043780 Hentrich, Jr. et al. Feb 2009 A1
20090070435 Abhyanker Mar 2009 A1
20090089134 Uyeki Apr 2009 A1
20090106036 Tamura et al. Apr 2009 A1
20090112687 Blair et al. Apr 2009 A1
20090138329 Wanker May 2009 A1
20090182232 Zhang et al. Jul 2009 A1
20090187513 Noy et al. Jul 2009 A1
20090187939 Lajoie Jul 2009 A1
20090198507 Rhodus Aug 2009 A1
20090204454 Lagudi Aug 2009 A1
20090204655 Wendelberger Aug 2009 A1
20090222532 Finlaw Sep 2009 A1
20090265607 Raz et al. Oct 2009 A1
20090313035 Esser et al. Dec 2009 A1
20100011415 Cortes et al. Jan 2010 A1
20100023393 Costy et al. Jan 2010 A1
20100070343 Taira et al. Mar 2010 A1
20100082778 Muilenburg et al. Apr 2010 A1
20100082780 Muilenburg et al. Apr 2010 A1
20100088158 Pollack Apr 2010 A1
20100100259 Geiter Apr 2010 A1
20100100506 Marot Apr 2010 A1
20100131363 Sievert et al. May 2010 A1
20100235219 Merrick et al. Sep 2010 A1
20100235231 Jewer Sep 2010 A1
20100293030 Wu Nov 2010 A1
20100312608 Shan et al. Dec 2010 A1
20100318408 Sankaran et al. Dec 2010 A1
20100324777 Tominaga et al. Dec 2010 A1
20110010432 Uyeki Jan 2011 A1
20110015989 Tidwell et al. Jan 2011 A1
20110022525 Swinson et al. Jan 2011 A1
20110082804 Swinson et al. Apr 2011 A1
20110145064 Anderson et al. Jun 2011 A1
20110161167 Jallapuram Jun 2011 A1
20110191264 Inghelbrecht et al. Aug 2011 A1
20110196762 Dupont Aug 2011 A1
20110224864 Gellatly et al. Sep 2011 A1
20110231055 Knight et al. Sep 2011 A1
20110288937 Manoogian, III Nov 2011 A1
20110307296 Hall et al. Dec 2011 A1
20110307411 Bolivar et al. Dec 2011 A1
20120066010 Williams et al. Mar 2012 A1
20120089474 Xiao et al. Apr 2012 A1
20120095804 Calabrese et al. Apr 2012 A1
20120116868 Chin et al. May 2012 A1
20120158211 Chen et al. Jun 2012 A1
20120209714 Douglas et al. Aug 2012 A1
20120221125 Bell Aug 2012 A1
20120268294 Michaelis et al. Oct 2012 A1
20120278886 Luna Nov 2012 A1
20120284113 Pollak Nov 2012 A1
20120316981 Hoover et al. Dec 2012 A1
20130046432 Edwards et al. Feb 2013 A1
20130080196 Schroeder et al. Mar 2013 A1
20130080305 Virag et al. Mar 2013 A1
20130151334 Berkhin et al. Jun 2013 A1
20130191445 Gayman et al. Jul 2013 A1
20130204484 Ricci Aug 2013 A1
20130226699 Long Aug 2013 A1
20130325541 Capriotti et al. Dec 2013 A1
20130332023 Bertosa et al. Dec 2013 A1
20140012659 Yan Jan 2014 A1
20140026037 Garb et al. Jan 2014 A1
20140052327 Hosein et al. Feb 2014 A1
20140088866 Knapp et al. Mar 2014 A1
20140094992 Lambert et al. Apr 2014 A1
20140122178 Knight May 2014 A1
20140136278 Carvalho May 2014 A1
20140229391 East et al. Aug 2014 A1
20140244110 Tharaldson et al. Aug 2014 A1
20140277906 Lowrey et al. Sep 2014 A1
20140278805 Thompson Sep 2014 A1
20140316825 Van Dijk et al. Oct 2014 A1
20140324275 Stanek et al. Oct 2014 A1
20140324536 Cotton Oct 2014 A1
20140331301 Subramani et al. Nov 2014 A1
20140337163 Whisnant Nov 2014 A1
20140379530 Kim et al. Dec 2014 A1
20140379817 Logue Dec 2014 A1
20150057875 McGinnis et al. Feb 2015 A1
20150066781 Johnson et al. Mar 2015 A1
20150066933 Kolodziej et al. Mar 2015 A1
20150100199 Kurnik et al. Apr 2015 A1
20150142256 Jones May 2015 A1
20150227894 Mapes, Jr. et al. Aug 2015 A1
20150268059 Borghesani et al. Sep 2015 A1
20150278886 Fusz Oct 2015 A1
20150286979 Ming et al. Oct 2015 A1
20150334165 Arling et al. Nov 2015 A1
20160004516 Ivanov et al. Jan 2016 A1
20160059412 Oleynik Mar 2016 A1
20160071054 Kakarala et al. Mar 2016 A1
20160092944 Taylor et al. Mar 2016 A1
20160132935 Shen et al. May 2016 A1
20160140609 Demir May 2016 A1
20160140620 Pinkowish et al. May 2016 A1
20160140622 Wang et al. May 2016 A1
20160148439 Akselrod et al. May 2016 A1
20160180358 Battista Jun 2016 A1
20160180378 Toshida et al. Jun 2016 A1
20160180418 Jaeger Jun 2016 A1
20160267503 Zakai-Or et al. Sep 2016 A1
20160275533 Smith et al. Sep 2016 A1
20160307174 Marcelle et al. Oct 2016 A1
20160357599 Glatfelter Dec 2016 A1
20160371641 Wilson et al. Dec 2016 A1
20170034547 Jain et al. Feb 2017 A1
20170039785 Richter et al. Feb 2017 A1
20170053460 Hauser et al. Feb 2017 A1
20170064038 Chen Mar 2017 A1
20170124525 Johnson et al. May 2017 A1
20170262894 Kirti et al. Sep 2017 A1
20170293894 Taliwal et al. Oct 2017 A1
20170308844 Kelley Oct 2017 A1
20170308864 Kelley Oct 2017 A1
20170308865 Kelley Oct 2017 A1
20170316459 Strauss et al. Nov 2017 A1
20170337573 Toprak Nov 2017 A1
20170352054 Ma et al. Dec 2017 A1
20180095733 Torman et al. Apr 2018 A1
20180225710 Kar et al. Aug 2018 A1
20180232749 Moore, Jr. et al. Aug 2018 A1
20180285901 Zackrone Oct 2018 A1
20180285925 Zackrone Oct 2018 A1
20190297162 Amar et al. Sep 2019 A1
20190334884 Ross et al. Oct 2019 A1
20200019388 Jaeger Jan 2020 A1
20200038363 Kim Feb 2020 A1
20200177476 Agarwal Jun 2020 A1
20210287106 Jerram Sep 2021 A1
20220046105 Amar et al. Feb 2022 A1
Foreign Referenced Citations (3)
Number Date Country
2494350 May 2004 CA
0461888 Mar 1995 EP
2007002759 Jan 2007 WO
Non-Patent Literature Citations (183)
Entry
U.S. Appl. No. 10/665,899 , Non-Final Office Action, dated Aug. 30, 2010, 23 pages.
U.S. Appl. No. 10/665,899 , Final Office Action, dated Feb. 24, 2010, 22 pages.
U.S. Appl. No. 10/665,899 , Final Office Action, dated May 11, 2009, 14 pages.
U.S. Appl. No. 10/665,899 , Non-Final Office Action, dated Nov. 13, 2008, 11 pages.
U.S. Appl. No. 10/665,899 , Non-Final Office Action, dated Sep. 14, 2009, 14 pages.
U.S. Appl. No. 11/149,909 , Final Office Action, dated Feb. 4, 2009, 14 pages.
U.S. Appl. No. 11/149,909 , Non-Final Office Action, dated May 13, 2008, 14 pages.
U.S. Appl. No. 11/149,909 , Non-Final Office Action, dated May 6, 2009, 6 pages.
U.S. Appl. No. 11/149,909 , Notice of Allowance, dated Sep. 16, 2009, 7 pages.
U.S. Appl. No. 11/414,939 , Non-Final Office Action, dated Jul. 19, 2010, 7 pages.
U.S. Appl. No. 11/414,939 , Notice of Allowance, dated Nov. 2, 2010.
U.S. Appl. No. 11/442,821 , Final Office Action, dated Apr. 7, 2009, 19 pages.
U.S. Appl. No. 11/442,821 , Notice of Allowance, dated Jul. 30, 2012, 6 pages.
U.S. Appl. No. 11/442,821 , Non-Final Office Action, dated Jun. 1, 2011, 23 pages.
U.S. Appl. No. 11/442,821 , Final Office Action, dated May 21, 2010, 28 pages.
U.S. Appl. No. 11/442,821 , Non-Final Office Action, dated Nov. 12, 2009, 19 pages.
U.S. Appl. No. 11/442,821 , Final Office Action, dated Nov. 29, 2011, 26 pages.
U.S. Appl. No. 11/442,821 , Non-Final Office Action, dated Sep. 3, 2008, 14 pages.
U.S. Appl. No. 11/446,011 , Notice of Allowance, dated Aug. 9, 2011, 10 pages.
U.S. Appl. No. 11/446,011 , Final Office Action, dated Jun. 8, 2010, 12 pages.
U.S. Appl. No. 11/446,011 , Non-Final Office Action, dated Mar. 1, 2011, 15 pages.
U.S. Appl. No. 11/524,602 , Notice of Allowance, dated Aug. 6, 2013, 22 pages.
U.S. Appl. No. 11/524,602 , Non-Final Office Action, dated Dec. 11, 2009, 20 pages.
U.S. Appl. No. 11/524,602 , Final Office Action, dated Jul. 27, 2010, 13 pages.
U.S. Appl. No. 11/524,602 , Non-Final Office Action, dated Nov. 14, 2011, 19 pages.
U.S. Appl. No. 11/525,009 , Non-Final Office Action, dated Aug. 10, 2011, 18 pages.
U.S. Appl. No. 11/525,009 , Final Office Action, dated Aug. 3, 2010, 16 pages.
U.S. Appl. No. 11/525,009 , Non-Final Office Action, dated Dec. 16, 2009, 20 pages.
U.S. Appl. No. 11/525,009 , Notice of Allowance, dated Jul. 23, 2012, 19 pages.
U.S. Appl. No. 12/243,852 , Restriction Requirement, dated Dec. 7, 2010.
U.S. Appl. No. 12/243,852 , Notice of Allowance, dated Feb. 27, 2013, 6 pages.
U.S. Appl. No. 12/243,852 , Non-Final Office Action, dated Jan. 16, 2013, 5 pages.
U.S. Appl. No. 12/243,852 , Non-Final Office Action, dated Mar. 17, 2011, 8 pages.
U.S. Appl. No. 12/243,852 , Supplemental Notice of Allowability, dated Mar. 19, 2013, 3 pages.
U.S. Appl. No. 12/243,852 , Final Office Action, dated Oct. 24, 2011, 13 pages.
U.S. Appl. No. 12/243,855 , Notice of Allowance, dated Nov. 22, 2010, 10 pages.
U.S. Appl. No. 12/243,855 , Non-Final Office Action, dated Oct. 14, 2010, 6 pages.
U.S. Appl. No. 12/243,855 , Notice of Allowance, dated Oct. 28, 2010, 5 pages.
U.S. Appl. No. 12/243,861 , Final Office Action, dated Jun. 22, 2011, 5 pages.
U.S. Appl. No. 12/243,861 , Non-Final Office Action, dated Nov. 8, 2010, 8 pgs.
U.S. Appl. No. 12/243,861 , Notice of Allowance, dated Sep. 6, 2011, 10 pgs.
U.S. Appl. No. 13/025,019 , Non-Final Office Action, dated Apr. 22, 2016, 16 pages.
U.S. Appl. No. 13/025,019 , Non-Final Office Action, dated Apr. 5, 2013, 15 pages.
U.S. Appl. No. 13/025,019 , Final Office Action, dated Aug. 28, 2015, 25 pages.
U.S. Appl. No. 13/025,019, Non-Final Office Action, dated Sep. 18, 2014, 15 pages.
U.S. Appl. No. 13/025,019 , Non-Final Office Action, dated Oct. 6, 2017, 17 pages.
Bedell, Doug , Dallas Morning News, “I Know Someone Who Knows Kevin Bacon”. Oct. 27, 1998. 4 pgs.
Chadwick, D.W., “Understanding X.500—The Directory”, Available at <http://sec.cs.kent.ac.uk/x500book/>. Entire work cited., 1996.
Chatterjee, Pallab , et al., “On-board diagnostics not just for racing anymore”, EDN.com, May 6, 2013, 7 pages.
Chen, Deren , “Business to Business Standard and Supply Chain System Framework in Virtual Enterprises”, Computer Supported Cooperative Work in Design, The Sixth International Conference on 2001, pp. 472-476.
Clemens Grelck , “A Multithread Compiler Backend for High-Level Array Programming”, 2003.
CNY Business Journal , “Frank La Voila named Southern Tier Small-Business Person of 1999”, Jun. 11, 1999, 2 pages.
Croswell, Wayne , “Service Shop Optimiztion”, Modern Tire Retailer, May 21, 2013, 7 pages.
Davis, Peter T., et al., “Sams Teach Yourself Microsoft Windows NT Server 4 in 21 Days”, Sams® Publishing, ISBN: 0-672-31555-6, 1999, printed Dec. 21, 2008, 15 pages.
Derfler, Frank J., et al., “How Networks Work: Millennium Edition”, Que, A Division of Macmillan Computer Publishing, ISBN: 0-7897-2445-6, 2000, 9 pages.
Drawbaugh, Ben , “Automatic Link Review: an expensive way to learn better driving habits”, Endgadget.com, Nov. 26, 2013, 14 pages.
Emmanuel, Daniel , “Basics to Creating an Appointment System for Automotive Service Customers”, Automotiveservicemanagement.com, 2006, 9 pages.
Hogue , et al., “Thresher: Automating the Unwrapping of Semantic Content from the World Wide Web”, ACM, 2005, pp. 86-95.
Housel, Barron C., et al., “WebExpress: A client/intercept based system for optimizing Web browsing in a wireless environment”, Google, 1998, pp. 419-431.
Hu, Bo , “A Platform based Distributed Service Framework for Large-scale Cloud Ecosystem Development”, IEEE Computer Society, 2015, 8 pages.
Interconnection , In Roget's II The New Thesaurus. Boston, MA: Houghton Mifflin http://www.credoreference.com/entry/hmrogets/interconnection, 2003, Retrieved Jul. 16, 2009, 1 page.
Jenkins, Will , “Real-time vehicle performance monitoring with data intergrity”, A Thesis Submitted to the Faculty of Mississippi State University, Oct. 2006, 57 pages.
Johns, Pamela , et al., “Competitive intelligence in service marketing”, Marketing Intelligence & Planning, vol. 28, No. 5, 2010, pp. 551-570.
Lavrinc, Damon , “First Android-powered infotainment system coming to 2012 Saab 9-3”, Autoblog.com, Mar. 2, 2011, 8 pages.
Lee, Adam J., et al., “Searching for Open Windows and Unlocked Doors: Port Scanning in Large-Scale Commodity Clusters”, Cluster Computing and the Grid, 2005. IEEE International Symposium on vol. 1, 2005, pp. 146-151.
Michener, J.R., et al., “Managing System and Active-Content Integrity”, Computer; vol. 33, Issue: 7,2000, pp. 108-110.
Milic-Frayling, Natasa , et al., “SmartView: Enhanced Document Viewer for Mobile Devices”, Google, Nov. 15, 2002, 11 pages.
Needham, Charlie , “Google Now Taking Appointments for Auto Repair Shops”, Autoshopsolutions.com, Aug. 25, 2015, 6 pages.
Open Bank Project , https://www.openbankproject.com/, retrieved Nov. 23, 2020, 10 pages.
openbay.com Web Pages , Openbay.com, retrieved from archive.org May 14, 2019, Apr. 2015, 6 pages.
openbay.com Web Pages , Openbay.com, retrieved from archive.org on May 14, 2019, Feb. 2014, 2 pages.
openbay.com Web Pages , Openbay.com, retrieved from archive.org, May 14, 2019, Mar. 2015, 11 pages.
Phelan, Mark , “Smart phone app aims to automate car repairs”, Detroit Free Press Auto Critic, Mar. 31, 2015, 2 pages.
Pubnub Staff , “Streaming Vehicle Data in Realtime with Automatic (Pt 1)”, Pubnub.com, Aug. 17, 2015, 13 pages.
Standards for Technology in Auto , https://www.starstandard.org/, retrieved Nov. 23, 2020, 4 pages.
Strebe, Matthew , et al., MCSE: NT Server 4 Study Guide, Third Edition. SYBEX Inc. Front matter, 2000, pp. 284-293, and 308-347.
Warren, Tamara , “This Device Determines What Ails Your Car and Finds a Repair Shop—Automatically”, CarAndDriver.com, Apr. 8, 2015, 7 pages.
You, Song , et al., “Overview of Remote Diagnosis and Maintenance for Automotive Systems”, 2005 SAE World Congress, Apr. 11-14, 2015, 10 pages.
http://web.archive.org/web/20010718130244/http://chromedata.com/maing2/about/index.asp, 1 pg.
http://web.archive.org/web/20050305055408/http://www.dealerclick.com/, 1 pg.
http://web.archive.org/web/20050528073821/http://www.kbb.com/, 1 pg.
http://web.archive.org/web/20050531000823/http://www.carfax.com/, 1 pg.
Internet Archive Wayback Machine, archive of LDAP Browser.com—FAQ. Archived Dec. 11, 2000. Available at <http://web.archive.org/web/200012110152/http://www.ldapbrowser.com/faq/faq.php3?sID=fe4ae66f023d86909f35e974f3a1ce>.
Internet Archive Wayback Machine, archive of LDAP Browser.com—Product Info. Archived Dec. 11, 2000. Available at <http://web.archive.org/web/200012110541/http://www.ldapbrowser.com/prodinfo/prodinfo.php3?sID=fe4ae66f2fo23d86909f35e974f3a1ce>.
Internet Archive: Audio Archive, http://www.archive.org/audio/audio-searchresults.php?search=@start=0&limit=100&sort=ad, printed May 12, 2004, 12 pgs.
Internet Archive: Democracy Now, http://www.archive.org/audio/collection.php?collection=democracy_now, printed May 12, 2004, 2 pgs.
Java 2 Platform, Enterprise Edition (J2EE) Overview, printed Mar. 6, 2010, 3 pgs.
Java version history—Wikipedia, the free encyclopedia, printed Mar. 6, 2010, 9 pgs.
Permissions in the Java™ 2 SDK, printed Mar. 6, 2010, 45 pgs.
Trademark Electronic Search System record for U.S. Appl. No. 76/375,405, Word Mark “NITRA”.
“An Appointment with Destiny—The Time for Web-Enabled Scheduling has Arrived”, Link Fall, 2007, 2 pages.
“How a Solution found a Problem of Scheduling Service Appointments”, Automotive News, 2016, 4 pages.
“IBM Tivoli Access Manager Base Administration Guide”, Version 5.1. International Business Machines Corporation. Entire book enclosed and cited., 2003, 402 pgs.
“NetFormx Offers Advanced Network Discovery Software”, PR Newswire. Retrieved from http://www.highbeam.com/doc/1G1-54102907.html>., Mar. 15, 1999.
“Openbay Announces First-of-its-Kind Connected Car Repair Service”, openbay.com, Mar. 31, 2015, 14 pages.
“Service Advisor”, Automotive Dealership Institute, 2007, 26 pages.
“xTime.com Web Pages”, Jan. 8, 2015, 1 page.
“XTimes Newsletter”, vol. 7, 2013, 4 pages.
U.S. Appl. No. 10/350,795 , Non-Final Office Action, dated Dec. 26, 2008, 13 pages.
U.S. Appl. No. 10/350,795 , Non-Final Office Action, dated Feb. 6, 2006, 11 pages.
U.S. Appl. No. 10/350,795 , Non-Final Office Action, dated Jul. 22, 2009, 22 pages.
U.S. Appl. No. 10/350,795 , Final Office Action, dated Jul. 6, 2012, 26 pages.
U.S. Appl. No. 10/350,795 , Non-Final Office Action, dated Jun. 29, 2006, 11 pages.
U.S. Appl. No. 10/350,795 , Non-Final Office Action, dated Mar. 12, 2007, 10 pages.
U.S. Appl. No. 10/350,795 , Final Office Action, dated Mar. 3, 2010, 24 pages.
U.S. Appl. No. 10/350,795 , Non-Final Office Action, dated May 29, 2008, 10 pages.
U.S. Appl. No. 10/350,795 , Notice of Allowance, dated May 7, 2012, 15 pages.
U.S. Appl. No. 10/350,795 , Non-Final Office Action, dated Nov. 1, 2010, 19 pages.
U.S. Appl. No. 10/350,796 , Notice of Allowance, dated Feb. 1, 2006, 5 pages.
U.S. Appl. No. 10/350,796 , Non-Final Office Action, dated May 19, 2005, 7 pages.
U.S. Appl. No. 10/350,810 , Notice of Allowance, dated Apr. 14, 2008, 6 pages.
U.S. Appl. No. 10/350,810 , Non-Final Office Action, dated Apr. 17, 2007, 12 pages.
U.S. Appl. No. 10/350,810 , Final Office Action, dated Apr. 5, 2005, 12 pages.
U.S. Appl. No. 10/350,810 , Notice of Non-compliant Amendment, dated Dec. 12, 2006.
U.S. Appl. No. 10/350,810 , Non-Final Office Action, dated Dec. 9, 2005, 14 pages.
U.S. Appl. No. 10/350,810 , Final Office Action, dated May 18, 2006, 15 pages.
U.S. Appl. No. 10/350,810 , Final Office Action, dated Nov. 14, 2007, 13 pages.
U.S. Appl. No. 10/350,810 , Non-Final Office Action, dated Sep. 22, 2004, 10 pages.
U.S. Appl. No. 10/351,465 , Non-Final Office Action, dated Jul. 27, 2004, 9 pages.
U.S. Appl. No. 10/351,465 , Final Office Action, dated May 5, 2005, 8 pages.
U.S. Appl. No. 10/351,465 , Notice of Allowance, dated Sep. 21, 2005, 4 pages.
U.S. Appl. No. 10/351,606 , Notice of Allowance, dated Apr. 4, 2006, 12 pages.
U.S. Appl. No. 10/665,899, Non-Final Office Action, dated Sep. 17, 2017, 11 pages.
U.S. Appl. No. 10/351,606 , Non-final Office Action, dated Dec. 19, 2005, 7 pages.
U.S. Appl. No. 10/665,899, Final Office Action, dated Mar. 8, 2011, 21 pages.
U.S. Appl. No. 10/351,606 , Non-final Office Action, dated May 17, 2004, 5 pages.
U.S. Appl. No. 10/665,899, Final Office Action, dated Jul. 7, 2008, 11 pages.
U.S. Appl. No. 13/025,019 , Final Office Action, dated Sep. 12, 2013, 13 pages.
U.S. Appl. No. 13/025,019 , Notice of Allowance, dated Sep. 26, 2019, 9 pages.
U.S. Appl. No. 14/208,042 , Final Office Action, dated Apr. 16, 2018.
U.S. Appl. No. 14/208,042 , Non-Final Office Action, dated Aug. 21, 2020, 13 pages.
U.S. Appl. No. 14/208,042 , Final Office Action, dated Jan. 11, 2019, 16 pages.
U.S. Appl. No. 14/208,042 , Advisory Action, dated Jul. 12, 2018.
U.S. Appl. No. 14/208,042 , Non-Final Office Action, dated Jun. 30, 2016, 23 pages.
U.S. Appl. No. 14/208,042 , Notice of Allowance, dated May 6, 2021, 13 pages.
U.S. Appl. No. 14/208,042 , Non-Final Office Action, dated Sep. 20, 2017.
U.S. Appl. No. 14/208,042 , Non-Final Office Action, dated Sep. 21, 2018.
U.S. Appl. No. 15/134,779 , Final Office Action, dated Feb. 27, 2020, 18 pages.
U.S. Appl. No. 15/134,779 , Non-Final Office Action, dated Jan. 30, 2019, 26 pages.
U.S. Appl. No. 15/134,779 , Advisory Action, dated Jul. 29, 2019, 6 pages.
U.S. Appl. No. 15/134,779 , Final Office Action, dated May 17, 2019, 25 pages.
U.S. Appl. No. 15/134,779 , Non-Final Office Action, dated Nov. 19, 2019, 27 pages.
U.S. Appl. No. 15/134,779 , Notice of Allowance, dated Sep. 9, 2020, 12 pages.
U.S. Appl. No. 15/134,793 , Non-Final Office Action, dated Jan. 30, 2019, 26 pages.
U.S. Appl. No. 15/134,793 , Advisory Action, dated Jul. 29, 2019, 6 pages.
U.S. Appl. No. 15/134,793 , Final Office Action, dated Mar. 27, 2020, 22 pages.
U.S. Appl. No. 15/134,793 , Final Office Action, dated May 13, 2019, 26 pages.
U.S. Appl. No. 15/134,793 , Non-Final Office Action, dated Nov. 19, 2019, 31 pages.
U.S. Appl. No. 15/134,793 , Notice of Allowance, dated Nov. 2, 2020, 13 pages.
U.S. Appl. No. 15/134,820 , Non-Final Office Action, dated Feb. 23, 2018.
U.S. Appl. No. 15/134,820 , Notice of Allowance, dated Jan. 28, 2019, 7 pages.
U.S. Appl. No. 15/134,820 , Final Office Action, dated Sep. 21, 2018.
U.S. Appl. No. 15/478,042 , Non-Final Office Action, dated Aug. 4, 2020, 42 pages.
U.S. Appl. No. 15/478,042 , Final Office Action, dated Mar. 19, 2020, 35 pages.
U.S. Appl. No. 15/478,042 , Final Office Action, dated May 5, 2021, 38 pages.
U.S. Appl. No. 15/478,042 , Non-Final Office Action, dated Oct. 10, 2019, 26 pages.
U.S. Appl. No. 15/478,048 , Final Office Action, dated Apr. 9, 2020, 42 pages.
U.S. Appl. No. 15/478,048 , Non-Final Office Action, dated Mar. 8, 2021, 69 pages.
U.S. Appl. No. 15/478,048 , Final Office Action, dated Sep. 17, 2021, 32 pages.
U.S. Appl. No. 15/478,048 , Non-Final Office Action, dated Sep. 30, 2019, 30 pages.
U.S. Appl. No. 15/602,999 , Notice of Allowance, dated Apr. 18, 2019, 6 pages.
U.S. Appl. No. 15/602,999 , Advisory Action, dated Jan. 31, 2019, 3 pages.
U.S. Appl. No. 15/602,999 , Non-Final Office Action, dated May 3, 2018.
U.S. Appl. No. 15/602,999 , Final Office Action, dated Nov. 21, 2018.
U.S. Appl. No. 16/041,552 , Final Office Action, dated Apr. 27, 2021, 23 pages.
U.S. Appl. No. 16/041,552 , Non-Final Office Action, dated Dec. 27, 2019, 13 pages.
U.S. Appl. No. 16/041,552 , Final Office Action, dated May 29, 2020, 18 pages.
U.S. Appl. No. 16/041,552 , Non-Final Office Action, dated Sep. 17, 2020, 16 pages.
U.S. Appl. No. 16/041,552 , Notice of Allowance, dated Sep. 30, 2021, 17 pages.
U.S. Appl. No. 16/911,154 , Non-Final Office Action, dated Sep. 16, 2021, 15 pages.
U.S. Appl. No. 16/951,833 , Non-Final Office Action, dated Feb. 4, 2021, 10 pages.
U.S. Appl. No. 16/951,833 , Notice of Allowance, dated Jun. 16, 2021, 14 pages.
Aloisio, Giovanni , et al., “Web-based access to the Grid using the Grid Resource Broker portal”, Google, 2002, pp. 1145-1160.
Anonymous , “Software ready for prime time”, Automotive News. Detroit, vol. 76, Issue 5996, Nov. 5, 2001, p. 28.
U.S. Appl. No. 16/911,154, Non-Final Office Action, dated Mar. 28, 2022, 17 pages.
Internet Archive Dan Gillmor Sep. 1, 1996.
U.S. Appl. No. 11/414,939, Non-Final Office Action, dated Mar. 9, 2010, 11 pages.
U.S. Appl. No. 11/446,011, Non-Final Office Action, dated Nov. 27, 2009, 14 pages.
U.S. Appl. No. 11/524,602, Final Office Action, dated Jun. 26, 2012, 11 pages.
U.S. Appl. No. 13/025,019, Final Office Action, dated Dec. 20, 2016, 16 pages.
U.S. Appl. No. 13/025,019, Final Office Action, dated Jul. 13, 2018, 11 pages.
U.S. Appl. No. 14/208,042, Final Office Action, dated Dec. 6, 2016, 26 pages.
U.S. Appl. No. 15/478,042, Non-Final Office Action, dated Nov. 19, 2021, 45 pages.
Related Publications (1)
Number Date Country
20220237171 A1 Jul 2022 US