Techniques for using tree data structures to maintain a transactionally consistent set with support for time-travel queries are described. When a transaction commits, a new version of the tree data structure is created using a copy-on-write based method such that the tree shares internal nodes with previous trees to save space. This approach may be used in the implementation of a transactional data catalog in which the files that make up a table are stored in a transactional set.

Methods and systems relating to a file distribution scheme in a computer network are disclosed that distributes files in an efficient manner that reduces, among other things, network traffic. In an embodiment of the invention, a method for updating a file is disclosed. In such a method, unique chunks in a first version of a digital file are identified. For a second version of the digital file, chunks that are the same as in the first version are identified. Recompilation information is generated and stored for these identified chunks. Also, for the second version of the digital file, chunks in the second version that are different from chunks in the first version are identified. Recompilation information is generated and stored for these identified chunks. With this information, the second version of the digital file is completely defined and can be efficiently stored.

Streaming data, such as streaming records transmitted from entities, can be managed. For example, a new record associated with an entity can be received. There can be an existing record for the entity within a group of records. The group of records can form a block. A new block for the new record can be generated. A datastore can be updated to indicate that the new block has the most current record for the entity. Entries in the datastore can be filtered to identify a subgroup of blocks that has the most current record for each entity of multiple entities. A combined group of blocks can be generated by joining the new block with the subgroup of blocks. The combined group of blocks can be processed as a batch of data by a processing engine.

A computing platform may communicate with a device agent to receive digital system maintenance reporting, which may include information regarding steps taken to resolve issues of a digital system during a troubleshooting process. The computing platform may analyze the steps taken, and determine whether the steps resolved the troubleshooting. The computing platform may filter ineffective steps, and store steps associated with successful solutions in one or more distributed databases. The computing platform may receive information identifying a problem faced by a different system. The computing platform may analyze the distributed database to identify similar steps that successfully resolved the problem in the past, and mitigate the problem using the similar successful steps.

Systems and methods for maintaining data objects include receiving an event in a queue indicating a change to a data source; obtaining data corresponding to the event from the data source; determining that a monitored item condition defined in a workflow is satisfied based on the data corresponding to the event; generating a data object responsive to the monitored item condition being satisfied; identifying, using a mapping between fields and triggers generated based on the workflow, a trigger defined in the workflow that uses a first field of one or more fields; determining that the value of the first field satisfies a trigger condition of the trigger; and performing, responsive to determining that the value satisfies the trigger condition, an action corresponding to the trigger defined in the workflow.

A computer-implemented method for database management is provided. The method comprises: receiving, from a client device, first data to be stored in a database system that comprises first data storage configured to store a data table and a deletion history table; storing the first data in second data storage that is external to the database system and that is in communication with the database system via a network; obtaining a link that enables access, via the network, to the first data stored in the second data storage; storing the link in the data table; and performing a deletion operation of the first data, in response to a request from the client device to delete the first data from the database system, wherein the deletion operation comprises: deleting the link from the data table without deleting the first data from the second data storage; and storing the link in the deletion history table with a timestamp corresponding to a point in time when the link is deleted from the data table.

A data processing system may store a data set at a plurality of data centers. The data centers and hosts within the data centers may, for example, be organized according to a multi-tiered ring arrangement. A hashing arrangement may be used to implement the ring arrangement to select the data centers and hosts where the writing and reading of the data sets occurs. Version histories may also be written and read a the hosts and may be used to evaluate causal relationships between the data sets after the reading occurs.

Methods and systems are disclosed for tracking change data in a database. A database, stored at a computer system, is accessed with a plurality of data written to fields in the database, wherein each data in the fields comprises a record header. Data is changed in at least one field of the plurality of data in the database via the computer system, wherein the changing the data changes the record header for the at least one field. A transaction identification (ID) is stored in the record header for each change to the at least one field. A flag is created in the record header signaling the change to the at least one field. Successive versions of the database are linked together such that a subscriber accessing the database can automatically view a current version of the database with the change by accessing the record header and identifying the flag.

A system for providing context tree based on data model is disclosed. The system comprises an interface, a processor, and a memory. The interface is configured to receive a data model entry point, and to receive one or more context filters. The processor is configured to determine context tree data based on the one or more context filters and the data model entry point from any context tree provider that has appropriate context tree information. The memory is coupled to the processor and is configured to provide the processor with instructions.

Determining occupants' interactions in a space by applying a computer vision algorithm to track an occupant in a set of images of a space to obtain locations in the space of the occupant over time, where a history log of the occupant includes the locations of the occupant in the space over time is created and history logs of a plurality of occupants are compared to extract interaction points between the plurality of occupants.