Настройки

Укажите год
-

Небесная энциклопедия

Космические корабли и станции, автоматические КА и методы их проектирования, бортовые комплексы управления, системы и средства жизнеобеспечения, особенности технологии производства ракетно-космических систем

Подробнее
-

Мониторинг СМИ

Мониторинг СМИ и социальных сетей. Сканирование интернета, новостных сайтов, специализированных контентных площадок на базе мессенджеров. Гибкие настройки фильтров и первоначальных источников.

Подробнее

Форма поиска

Поддерживает ввод нескольких поисковых фраз (по одной на строку). При поиске обеспечивает поддержку морфологии русского и английского языка
Ведите корректный номера.
Ведите корректный номера.
Ведите корректный номера.
Ведите корректный номера.
Укажите год
Укажите год
Применить Всего найдено 2753. Отображено 100.
05-04-2012 дата публикации

Master data management versioning

Номер: US20120084257A1
Автор: Latesh Pant, Neelesh V. Bansode, Nitin Pratap Jain, Shashank Shekhar, Thomas K. Ryan, Vivek Shandilya
Принадлежит: Teradata US Inc

A method, system, apparatus, and article of manufacture provide the ability to maintain multiple versions of structured views of data in a computer system. A relational database management system (RDBMS) is executed that stores master data in the computer system in master RDBMS tables. The master data is hierarchical in nature and hierarchy metadata for the master data is stored in the RDBMS tables. As part of a process and framework, a series of business rules and process workflows are maintained to manage the master data. Version tables are created in the RDBMS that correspond to each of the master RDBMS tables. Each of the version tables includes an attribute denoting version information. Versions of the master data are defined by replicating the master data and hierarchy metadata into the corresponding version tables. The version tables are used to graphically visualize, manage, and manipulate the versions of the master data.

Подробнее
Номер записи: 1
05-04-2012 дата публикации

System, method and computer program product for validating one or more metadata objects

Номер: US20120084266A1
Автор: Adam Gross, Benji Jasik, David BROOKS, Douglas Chasman, Eric David Bezar, Lewis Wiley Tucker, Scott Hansma, Simon Wong, Steven Tamm, Tien Tzuo, Timothy Mason
Принадлежит: Salesforce com Inc

In accordance with embodiments, there are provided mechanisms and methods for creating, exporting, viewing and testing, and importing custom applications in a multitenant database environment. These mechanisms and methods can enable embodiments to provide a vehicle for sharing applications across organizational boundaries. The ability to share applications across organizational boundaries can enable tenants in a multi-tenant database system, for example, to easily and efficiently import and export, and thus share, applications with other tenants in the multi-tenant environment.

Подробнее
Номер записи: 2
10-05-2012 дата публикации

System and method for synchronizing operations among a plurality of independently clocked digital data processing devices

Номер: US20120117200A1
Автор: Nicholas A. J. Millington
Принадлежит: Individual

A system is described for maintaining synchrony of operations among a plurality of devices having independent clocking arrangements. A task distribution device is to distribute tasks to a synchrony group comprising a plurality of devices to perform tasks distributed by the task distribution device in synchrony. The task distribution device distributes each task to synchrony group members over a network. Each task is associated with a time stamp that indicates a time, relative to a clock maintained by the task distribution device, at which synchrony group members are to execute the task. Each synchrony group member periodically obtains from the task distribution device an indication of current time indicated by its clock, determines a time differential between the task distribution device's clock and its respective clock and determines therefrom a time at which, according to its respective clock, the time stamp indicates that it is to execute the task.

Подробнее
Номер записи: 3
26-07-2012 дата публикации

System and method for synchronizing operations among a plurality of independently clocked digital data processing devices

Номер: US20120192071A1
Автор: Nicholas A. J. Millington
Принадлежит: Individual

A system is described for maintaining synchrony of operations among a plurality of devices having independent clocking arrangements. A task distribution device is to distribute tasks to a synchrony group comprising a plurality of devices to perform tasks distributed by the task distribution device in synchrony. The task distribution device distributes each task to synchrony group members over a network. Each task is associated with a time stamp that indicates a time, relative to a clock maintained by the task distribution device, at which synchrony group members are to execute the task. Each synchrony group member periodically obtains from the task distribution device an indication of current time indicated by its clock, determines a time differential between the task distribution device's clock and its respective clock and determines there from a time at which, according to its respective clock, the time stamp indicates that it is to execute the task.

Подробнее
Номер записи: 4
21-03-2013 дата публикации

Scalable interactive display of distributed data

Номер: US20130073542A1
Автор: Stephen Phillip Sorkin, Steve Yu Zhang
Принадлежит: Splunk Inc

A method, system, and processor-readable storage medium are directed towards generating a report derived from data, such as event data, stored on a plurality of distributed nodes. In one embodiment the analysis is generated using a “divide and conquer” algorithm, such that each distributed node analyzes locally stored event data while an aggregating node combines these analysis results to generate the report. In one embodiment, each distributed node also transmits a list of event data references associated with the analysis result to the aggregating node. The aggregating node may then generate a global ordered list of data references based on the list of event data references received from each distributed node. Subsequently, in response to a user selection of a range of global event data, the report may dynamically retrieve event data from one or more distributed nodes for display according to the global order.

Подробнее
Номер записи: 5
18-04-2013 дата публикации

System and method for synchronizing operations among a plurality of independently clocked digital data processing devices

Номер: US20130094670A1
Автор: Nicholas A. J. Millington
Принадлежит: Sonos Inc

An audio information source interface that receives first audio information from an audio information source directly connected to the audio playback device; an ADC configured to sample the first audio information; a network interface configured to connect the audio playback device to a network and to receive packets from the network containing second audio information and playback timing information from a network audio information source; a DAC for generating an analog audio signal based on either the first or second audio information; an audio amplifier interconnected with the DAC and configured to amplify the audio signal; an audio reproduction device interface interconnected with the audio amplifier; and, a control module configured to receive commands via the network interface and to provide to the DAC one of the first or second audio information.

Подробнее
Номер записи: 6
06-06-2013 дата публикации

Trusting crowdsourced data with issued tags

Номер: US20130144879A1
Автор: Shai Guday, Thomas Werner Kuehnel
Принадлежит: Microsoft Corp

Embodiments control submission of crowdsourced data from a computing device to a cloud service. The cloud service receives a packet from the computing device having collected data and a single-use data tag associated therewith. The single-use data tag represents one of a threshold quantity of single-use data tags issued to the computing device. The cloud service validates the single-use data tag in the received packet by, for example, searching for the single-use data tag in a tag store maintained by the cloud service. The collected data from the received packet is stored by the cloud service based on the validation. After validation, the tag store is updated to prevent re-use of the single-use data tag. In some embodiments, the cloud service is a location service receiving crowdsourced beacon fingerprint data from a plurality of mobile computing devices.

Подробнее
Номер записи: 7
15-08-2013 дата публикации

System and method for synchronizing operations among a plurality of independently clocked digital data processing devices

Номер: US20130208911A1
Автор: Nicholas A. J. Millington
Принадлежит: Sonos Inc

In a network comprising at least a first zone player and a second zone player, a method comprising: receiving, at a user interface module, a command to establish a synchrony group, wherein the synchrony group comprises at least the first zone player and the second zone player; and displaying, at the user interface module, a list of information identifying a plurality of items queued for playback by the synchrony group, wherein (i) at least one of the items on the list has associated location data indicating the at least one item is located on a device attached to the local area network, and (ii) at least one other of the items on the list has associated location data indicating the at least one other item is located on a wide area network.

Подробнее
Номер записи: 8
29-08-2013 дата публикации

System and method for synchronizing operations among a plurality of independently clocked digital data processing devices

Номер: US20130226323A1
Автор: Nicholas A. J. Millington
Принадлежит: Sonos Inc

An audio processing device comprising: a network interface configured to connect the audio processing device to a network; an audio information channelization device connected to the network interface and configured to receive audio via the network interface; an audio reproduction device interface configured to output audio to a playback device; a user interface module interface configured to transmit, via the network interface to a user interface module, status information pertaining to the status of a synchrony group, wherein the audio processing device is a member of the synchrony group with at least one additional audio processing device.

Подробнее
Номер записи: 9
05-09-2013 дата публикации

System and method for synchronizing operations among a plurality of independently clocked digital data processing devices

Номер: US20130231766A1
Автор: Nicholas A. J. Millington
Принадлежит: Sonos Inc

A plurality of zone players, including at least a first player and a second zone player, wherein the first zone player is designated as a master device of a synchrony group, a method comprising: determining, by the first zone player, that the second zone player should be designated as the master device of the synchrony group; instructing, by the first zone player, the second zone player to be designated as the master device of the synchrony group; and causing, at the first zone player, the first zone player to lose its designation as the master device of the synchrony group.

Подробнее
Номер записи: 10
05-09-2013 дата публикации

System and method for synchronizing operations among a plurality of independently clocked digital data processing devices

Номер: US20130232214A1
Автор: Nicholas A. J. Millington
Принадлежит: Sonos Inc

In a network comprising a plurality of zone players, including at least a first zone player and a second zone player, a method comprising: receiving, by the first zone player, first control information from a user interface module; based on the received first control information, transmitting, by the first zone player, second control information to the second zone player, wherein the second control information comprises (i) a network address of an audio information channelization device that provides audio information and playback timing information, and (ii) a multicast address that the audio information channelization device uses to broadcast audio information and playback timing information to the network; and playing, by the first zone player, the audio information in synchrony with the second zone player.

Подробнее
Номер записи: 11
07-01-2021 дата публикации

ANALYSIS OF STREAMING DATA USING DELTAS AND SNAPSHOTS

Номер: US20210004352A1
Автор: Iwakami Naoki, Madhavarapu Pradeep Jnana, RAWAL Darshan Bharatkumar
Принадлежит: Elastic Flash Inc.

Implementations described herein relate to methods, systems, and computer-readable media to obtain snapshots used for analysis of streaming data. In some implementations, a computer-implemented method includes receiving initial data that includes a plurality of identifiers and corresponding timestamps, generating and storing a snapshot based on the initial data, wherein the snapshot includes the identifiers and a corresponding status, receiving a data stream that includes a subset of the identifiers, activity information for each identifier in the subset, and corresponding timestamps. The method further includes periodically analyzing the data stream to obtain a delta that includes an updated status for each identifier in the subset, storing the delta separate from the snapshot. The method further includes receiving a request for identifiers that are active in a particular time period, and based on the particular time period, retrieving active identifiers from the data stream, the delta, or the snapshot. 1. A computer-implemented method comprising:receiving initial data that includes a plurality of identifiers and corresponding timestamps;generating and storing a snapshot based on the initial data, wherein the snapshot includes each of the identifiers and a corresponding status;receiving a data stream that includes a subset of the identifiers, activity information for each identifier in the subset of the identifiers, and corresponding timestamps, wherein the data stream is received after receiving the initial data;periodically analyzing the data stream to obtain a delta that includes an updated status for each identifier in the subset of identifiers;storing the delta separate from the snapshot;receiving a request for identifiers that are active in a particular time period; andbased on the particular time period, retrieving active identifiers from the data stream, the delta, or the snapshot.2. The computer-implemented method of claim 1 , further comprising claim 1 , ...

Подробнее
Номер записи: 12
02-01-2020 дата публикации

Data breach source and timeline analysis

Номер: US20200004646A1
Автор: David C. Reed, Gregory E. McBride
Принадлежит: International Business Machines Corp

A method for analyzing a potential data breach is disclosed. In one embodiment, such a method includes identifying a time frame and data store in which a data breach potentially occurred. The method reconstructs the data store to a point in time near an end of the time frame. The method then repeatedly performs the following until the data store reaches a point in time near a beginning of the time frame: revert to a previous version of the data store by removing an incremental update to the data store; record changes to the data store caused by removing the incremental update; and record timestamps associated with the changes. Once the data store reaches the point in time near the beginning of the time frame, the method creates a report that documents the changes and the timestamps and provides the report to a user. A corresponding system and computer program product are also disclosed.

Подробнее
Номер записи: 13
02-01-2020 дата публикации

MULTI-MASTER DATA REPLICATION IN A DISTRIBUTED MULTI-TENANT SYSTEM

Номер: US20200004734A1
Автор: Burstein Paul, Hansma Scott, Varley Ian
Принадлежит:

A multi-master replication system is disclosed. The multi-master replication system allows a large set of peer instances to collaboratively replicate data to each other. According to an example, a change detection thread running on a first server associated with a first instance of multiple instances of a replicated database monitors for changes to any of multiple records within one or more shared tables of the replicated database. Responsive to detection of a change to a record, an item is stored by the change detection thread onto a queue containing information regarding the change. Groups of changes are packaged into multiple chunks, in which each chunk (i) corresponds to a discrete unit of progress for both change detection and transport; (ii) is associated with multiple changed records; (iii) contains metadata about the multiple changed records; and (iv) does not contain data from the one or more shared tables. 1. A method comprising:monitoring, by a change detection thread running on a first server associated with a first instance of a plurality of instances of a replicated database, for changes to any of a plurality of records within one or more shared tables of the replicated database;responsive to detection of a change to a record of the plurality of records, storing, by the change detection thread, an item onto a queue containing information regarding the change; and corresponds to a discrete unit of progress for both change detection and transport;', 'is associated with a plurality of changed records;', 'contains metadata about the plurality of changed records; and', 'does not contain data from the one or more shared tables., 'packaging groups of changes into a plurality of chunks, wherein each chunk of the plurality of chunks2. The method of claim 1 , wherein said packaging comprises:periodically aggregating, by an indexer thread running on the first server, information regarding the plurality of changed records that have been committed since a previous ...

Подробнее
Номер записи: 14
10-01-2019 дата публикации

Information processing apparatus, information processing system, and non-transitory computer readable medium

Номер: US20190012303A1
Автор: Atsushi Maruyama, Naoki Okamoto, Rumiko Kakehi, Takenori Matsuo, Takuya Okamoto
Принадлежит: Fuji Xerox Co Ltd

An information processing apparatus includes: an attachment information assignor that assigns a comment on an electronic document made by a user as attachment information associated with a corresponding portion in the electronic document; and a conclusion attribute assignor that assigns a conclusion attribute in association with the attachment information, the conclusion attribute being an attribute indicating a type of conclusion of the attachment information.

Подробнее
Номер записи: 15
09-01-2020 дата публикации

SCALABLE LOG-BASED CONTINUOUS DATA PROTECTION FOR DISTRIBUTED DATABASES

Номер: US20200012568A1
Автор: Chandrasekharan Harini, Pokkunuri Rama Krishna Sandeep, Pol Parikshit Shivajirao, Subramanian Subramanian Sankara, Thiruchi Loganathan Rajaprabhu, Vig Akshat
Принадлежит: Amazon Technologies, Inc.

In response to determining that continuous data protection is to be enabled for a particular table of a database service, a service component verifies that automated transmission of change records of the table to a log-structured journal has been configured. A given change record comprises a before-image and an after-image associated with a committed database write, and is assigned a unique sequence number. In response to a determination to restore the table as of a specified point in time, a restore record set is identified from the journal with respect to a selected snapshot of the table. The restore record set includes change records which are not represented in the snapshot and are to be represented in the restored table. A restore result table is created using the selected snapshot and the restore record set. 121.-. (canceled)22. A method , comprising: storing a data object at a network-accessible service;', 'determining that data protection is to be enabled for the data object; and', 'in response to determining that data protection is to be enabled for the data object, initiating insertion, into a journal, of one or more records indicating respective writes directed to the data object., 'performing, at one or more computing devices23. The method as recited in claim 22 , further comprising performing claim 22 , at the one or more computing devices:in response to determining that the data object is to be restored, restoring the data object using at least a portion of the journal and a snapshot of the data object.24. The method as recited in claim 22 , further comprising performing claim 22 , at the one or more computing devices:inserting, into the journal, one or more time marker records; andrestoring the data object, wherein the restoring comprises examining the one or more time marker records.25. The method as recited in claim 22 , further comprising performing claim 22 , at the one or more computing devices:in response to the determining that data protection ...

Подробнее
Номер записи: 16
09-01-2020 дата публикации

Delayed Snapshot Isolation for Read Service at a Database

Номер: US20200012633A1
Автор: Kim Beomsoo, Kim Kyu Hwan, Lee Juchang, Muehle Michael, Park Chang Gyoo, Roterring Christoph, Singer Reiner, Thesing Werner
Принадлежит:

A computer implemented method is provided comprising receiving a group of transaction logs from a first database, allocating transaction logs from the group of transaction logs to a first queue and to a second queue, generating an end-of-group transaction log indicative of an end of the group of transaction logs, allocating the end-of-group log to the first queue and the second queue; replaying transaction logs from the first queue including the end-of-group transaction log allocated to the first queue, replaying transaction logs from the second queue including the end-of-group transaction log allocated to the second queue; and changing visibility of one or more transactions in response to replaying the end-of-group transaction log allocated to the first queue and the end-of-group transaction log allocated to the second queue. Related apparatus, systems, techniques and articles are also described. 1. A computer implemented method comprising:receiving, by at least one data processor of a computing device, a first group of transaction logs from a first database;allocating, by the at least one data processor, one or more transaction logs from the first group of transaction logs to a first queue;allocating, by the at least one data processor, one or more transaction logs from the first group of transaction logs to a second queue;generating, by the at least one data processor, an end-of-group transaction log indicative of an end of the first group of transaction logs;allocating, by the at least one data processor, the end-of-group log to the first queue and the second queue;replaying, by the at least one data processor, one or more transaction logs from the first queue including the end-of-group transaction log allocated to the first queue;replaying, by the at least one data processor, one or more transaction logs from the second queue including the end-of-group transaction log allocated to the second queue; andchanging, by the at least one data processor, visibility of ...

Подробнее
Номер записи: 17
09-01-2020 дата публикации

SYSTEMS AND METHODS FOR ACCESSING RECORDS VIA DERIVATIVE LOCATORS

Номер: US20200013064A1
Автор: Eisen Ori
Принадлежит:

Systems and methods are provided for accessing records using derivative locators. An open financial transaction may be initiated by a consumer at a merchant. The merchant may provide information relating to the transaction, which may include information about the consumer's device, to a repository. The merchant may provide transaction information to the acquiring bank, which may provide transaction to the global financial network, which may provide transaction information to an issuing bank. One or more requesting party (e.g., one or more of the acquiring bank, global financial network, or issuing bank) may formulate a derivative locator based on the transaction information received. The derivative locator may function as an index through which records in the repository may be accessed by the requesting party. A time comparison may be made in assisting with accessing the correct record in the repository. The requesting party may determine whether to accept or decline the transaction, optionally with the aid of the information accessed from the repository. 120.-. (canceled)21. A method of providing fraud indicators , the method comprising:receiving, by a computer processor of a fraud detection server, a first transaction information and a first timestamp associated with a first transaction, the first transaction information comprising a shared transaction specific information;formulating, by the computer processor of the fraud detection server, a first derivative locator based at least partly on the first transaction information;linking, by the computer processor of the fraud detection server, a first transaction record associated with the first transaction with the first derivative locator and the first timestamp;receiving, by the computer processor of the fraud detection server, a request for the first transaction record from a remote financial server, the request comprising a second encrypted transaction data packet comprising a second timestamp and a second ...

Подробнее
Номер записи: 18
03-02-2022 дата публикации

Timestamp consistency for synchronous replication

Номер: US20220035837A1
Автор: Harsha Handral Sridhara, Krishna Murthy Chandraiah setty Narasingarayanapeta, Rakesh Bhargava M.R.
Принадлежит: NetApp Inc

Techniques are provided for timestamp consistency. An operation targeting a first storage object having a synchronous replication relationship with a second storage object is intercepted. A timestamp is assigned to the operation. A replication operation is created as a replication of the operation. The same timestamp is assigned to the replication operation. The operation is implemented upon the first storage object and the replication operation is implemented upon the second storage object.

Подробнее
Номер записи: 19
17-01-2019 дата публикации

Cross-acl multi-master replication

Номер: US20190018873A1
Автор: John Antonio Carrino, John Kenneth Garrod, Katherine Brainard, Richard Allen Ducott, III
Принадлежит: Palantir Technologies Inc

Techniques for cross-ACL multi-master replication are provided. The techniques allow a replication site in a multi-master replication system implementing an asynchronous replication protocol and an access control policy to appropriately apply received data change updates to data maintained at the site even where a data change update is missing information because of the implemented access control policy.

Подробнее
Номер записи: 20
03-02-2022 дата публикации

Technologies for annotating process and user information for network flows

Номер: US20220038353A1
Автор: Abhishek Ranjan Singh, Anubhav Gupta, Hai Trong Vu, Jackson Ngoc Ki Pang, Navindra Yadav, Shashidhar Gandham, Shih-Chun Chang
Принадлежит: Cisco Technology Inc

Systems, methods, and computer-readable media for annotating process and user information for network flows. In some embodiments, a capturing agent, executing on a first device in a network, can monitor a network flow associated with the first device. The first device can be, for example, a virtual machine, a hypervisor, a server, or a network device. Next, the capturing agent can generate a control flow based on the network flow. The control flow may include metadata that describes the network flow. The capturing agent can then determine which process executing on the first device is associated with the network flow and label the control flow with this information. Finally, the capturing agent can transmit the labeled control flow to a second device, such as a collector, in the network.

Подробнее
Номер записи: 21
22-01-2015 дата публикации

System and Method for Performing Distributed Asynchronous Calculations in a Networked Environment

Номер: US20150026230A1
Автор: Beau D. Lyddon, Robert A. Kluin
Принадлежит: Workiva Inc

A method and associated system are provided for performing calculations in a distributed networked environment, comprising: updating a source element on a first computer; sending a calculate update signal to a target calculated element for updating on a target element computer that may be the first computer or a second computer connected to the first computer that uses the source element in a calculation; obtaining the updated source element by a process on the target element computer associated with the target calculated element in response to the sending; and performing a calculation to update the target calculated element using the obtained updated source element.

Подробнее
Номер записи: 22
10-02-2022 дата публикации

Event-Driven Computer Modeling System for Time Series Data

Номер: US20220043790A1
Автор: John Scott Kula
Принадлежит: TD Ameritrade IP Co Inc

A system stores instructions including, in response to receiving user input, identifying a first event type and a first security identifier and obtaining a first set of event dates from the event database and, for each event date of the first set of event dates, obtaining a corresponding event value on the corresponding event date of the first security identifier. The instructions include, for a first day related to each event date of the first set of event dates: obtaining a corresponding value on the first day of the first security identifier, determining a corresponding difference value between the corresponding event value and the corresponding value, and storing the corresponding difference value in a set of difference values. The instructions include calculating an average difference on the first day using the set of difference values and displaying the average difference and an event indicator corresponding to the first event type.

Подробнее
Номер записи: 23
30-01-2020 дата публикации

OPTIMIZING DATA WRITES IN A DISTRIBUTED COMPUTING SYSTEM

Номер: US20200034053A1
Автор: Kolloju Manukranth Viswakarma Chary, Sharma Arun Dattaram
Принадлежит:

The disclosure is directed to optimizing data writes in a distributed computing system, e.g., a social networking application. The system employs a write-ahead log (WAL) and a hybrid logical clock (HLC) together to improve data writes across data centers in the distributed computing system, including improving: (1) consensus monitoring and enforcement in replicating data across the data centers; (2) scalability of data writes, e.g., so that different data centers can together handle a sudden increase in data writes during specified periods and consistently maintain the time ordering of the data writes; (3) replication configuration of data centers so that client devices can specify a replication hierarchy per transaction, e.g., at the time of writing the data, rather than specifying at data center configuration time; and (4) a draining process to write transactions committed to the WAL to data storage systems in the data centers. 1. A computer-implemented method , comprising:receiving, at a computing system from a client device, a write request for writing a data item to a data storage system, wherein the computing system is one of multiple computing systems in a distributed computing system;writing, by the computing system, the data item to a write-ahead log in the computing system;assigning, by the computing system, a hybrid-logical-clock timestamp to the data item upon being written to the write-ahead log, wherein the hybrid-logical-clock timestamp is generated based on a hybrid logical clock of the distributed computing system; andreplicating, by the computing system, the data item to write-ahead logs of one or more of the multiple computing systems based on a consensus protocol that is based on hybrid-logical-clock timestamps.2. The computer-implemented method of claim 1 , further comprising:receiving, at an additional computing system from an additional client device after the data item is received by the computing system, an additional write request for ...

Подробнее
Номер записи: 24
30-01-2020 дата публикации

Source Authentication And Changed Primitive Verification Systems And Methods For Real Time Updating Of Cloud-Based HD 3-D Map

Номер: US20200034351A1
Автор: DU Zhiyuan, Lull Joseph, MALHAN Rajesh, Matsugatani Kazuoki
Принадлежит:

Systems and methods are disclosed and include a node storing a local table and a control module that collects heterogeneous sensor data, tracks objects in an environment of the node, and converts the heterogeneous sensor data into time series data. An object-relational mapping module formats the time series data for direct compatibility to data in a master database of a cloud-based server. A correlation module further formats the time series data to provide resultant data in a single format commonly used by multiple map sources. A first primitive extraction module extracts primitives from the resultant data. An edge computing module generates a first table of data corresponding to the primitives and compatible with a master table of the master database, detects a changed primitive, uploads the changed primitive to the cloud-based server, receives updated data based on the changed primitive, and updates the local table based on the updated data. 1. A node comprising:a memory storing a local table;a control module configured to (i) collect heterogeneous sensor data, (ii) track objects in an environment of the node, and (iii) convert the heterogeneous sensor data into time series data;an object-relational mapping module configured to format the time series data for direct compatibility to data in a master database of a cloud-based server;a correlation module configured to further format the time series data to provide resultant data in a single format commonly used by multiple map sources;a first primitive extraction module extract one or more primitives from the resultant data; and generate a first table of data corresponding to the one or more primitives and compatible with a master table of the master database,', 'compare the first table to the local table to detect a changed primitive,', 'upload the changed primitive and raw data corresponding to the changed primitive to the cloud-based server, and', 'receive updated data based on the changed primitive from the ...

Подробнее
Номер записи: 25
30-01-2020 дата публикации

DISTRIBUTED DATABASE TRANSACTION PROTOCOL

Номер: US20200034373A1
Автор: Kim Deok Koo, Lee Juchang, Park Chang Gyoo
Принадлежит: SAP SE

Technologies are described for facilitating transaction processing within a database environment having a coordinator node, a first worker node, and at least a second worker node. The coordinator node receives local transaction tokens from the first and the at least a second worker nodes. The coordinator nodes determines a synchronized transaction token using at least the local transaction tokens from the first and the at least a second worker nodes. The coordinator node sends the synchronized transaction token to the first and the at least a second worker nodes. 120-. (canceled)21. One or more computer-readable media storing computer-executable instructions for causing a server programmed thereby to perform database transaction processing within a database environment using data manipulation language (DML) statements , the server implementing a first worker node of a database system , the first worker node being in communication with a coordinator node , and the database system further including at least a second worker node , the database transaction processing comprising:receiving a multi-node database statement, the multi-node database statement comprising first operations to be performed at the first worker node and second operations to be performed at the at least a second worker node, the first operations differing at least in part from the second operations;determining that the multi-node database statement is associated with an indicator that the multi-node database statement can be executed with relaxed consistency the indicator being a consistency-level indicator provided in the multi-node database statement or the indicator being a consistency-level indicator provided in a request for a session between a database client which issued the multi-node database statement and the first worker node;based on the determining, without waiting to synchronize a local transaction token maintained by the first worker node with a global transaction token maintained by ...

Подробнее
Номер записи: 26
04-02-2021 дата публикации

Updating a local tree for a client synchronization service

Номер: US20210034642A1
Автор: John Lai
Принадлежит: Dropbox Inc

The disclosed technology relates to a system configured to detect a delete event for a content item at a first location on a local file system of a client device, wherein the first location on the file system is managed by a content management service. The system determines a second location for the content item and whether the delete event is associated with an add event for the content item based on the second location of the content item. If the delete event is associated with the add event, the system processes the delete event with the add event in a unitary update to a local tree, wherein the local tree represents a file system state.

Подробнее
Номер записи: 27
04-02-2021 дата публикации

DETERMINING OBJECT GEOLOCATIONS BASED ON HETEROGENEOUS DATA SOURCES

Номер: US20210034653A1
Автор: Elder Andrew, Gupta Anand, Wilczynski Peter
Принадлежит:

An example method of determining geolocations of objects based on information retrieved from heterogeneous data sources comprises: receiving, from a first data source associated with an object by an ontology-defined relationship, a first dataset including a first data item specifying a first time identifier and a first geolocation associated with the object; receiving, from a second data source associated with an object by an ontology-defined relationship, a second dataset including a second data item specifying a second time identifier and a second geolocation associated with the object; and determining, by applying a rule set associated with the ontology to the first dataset and the second dataset, a geolocation of the object and a corresponding time identifier. 1. A method , comprising:receiving, by a computer system, from a first data source associated with an object by an ontology-defined relationship, a first dataset including a first data item specifying a first time identifier and a first geolocation associated with the object;receiving, from a second data source associated with an object by an ontology-defined relationship, a second dataset including a second data item specifying a second time identifier and a second geolocation associated with the object; anddetermining, by applying a rule set associated with the ontology to the first dataset and the second dataset, a geolocation of the object and a corresponding time identifier.2. The method of claim 1 , further comprising:storing the geolocation of the object and the corresponding time identifier in an object database implementing the ontology.3. The method of claim 1 , further comprising:receiving a geolocation data request specifying the object; andtransmitting a response specifying the geolocation of the object and the corresponding time identifier.4. The method of claim 1 , wherein determining the geolocation of the object further comprises:determining a first priority associated with the first ...

Подробнее
Номер записи: 28
04-02-2021 дата публикации

DETERMINING GEOLOCATIONS OF COMPOSITE ENTITIES BASED ON HETEROGENEOUS DATA SOURCES

Номер: US20210034654A1
Автор: Elder Andrew, Gupta Anand, Wilczynski Peter
Принадлежит:

An example method of determining geolocations of composite entities based on information retrieved from heterogeneous data sources comprises: identifying, by a computer system, an association of a first object and a second object with a composite object; receiving, from a first data source associated with the first object by an ontology, a first dataset including a first data item specifying a first time identifier and a first geolocation associated with the first object; receiving, from a second data source associated with the second object by the ontology, a second dataset including a second data item specifying a second time identifier and a second geolocation associated with the second object; and determining, by applying a rule set associated with the ontology to the first dataset and the second dataset, a geolocation of the composite object and a corresponding time identifier. 1. A method , comprising:identifying, by a computer system, an association of a first object and a second object with a composite object;receiving, from a first data source associated with the first object by an ontology, a first dataset including a first data item specifying a first time identifier and a first geolocation associated with the first object;receiving, from a second data source associated with the second object by the ontology, a second dataset including a second data item specifying a second time identifier and a second geolocation associated with the second object; anddetermining, by applying a rule set associated with the ontology to the first dataset and the second dataset, a geolocation of the composite object and a corresponding time identifier.2. The method of claim 1 , further comprising:determining a geolocation of a second composite object; andidentifying, based on the geolocation of the first composite object and the geolocation of the second composite object, a relationship between the first composite object and the second composite object.3. The method of claim ...

Подробнее
Номер записи: 29
09-02-2017 дата публикации

Priority queue for exclusive locks

Номер: US20170039234A1
Автор: Mehul Wagle
Принадлежит: SAP SE

A system includes reception of a first request for a lock on a lock object, storage of a first entry associated with the first request and the lock object in a queue, determination of a first queue position associated with the first entry based on a first priority level of the first request and on a priority level of each of a plurality of entries in the queue associated with the lock object, determination of whether a predetermined expiration time associated with the first request has expired, and, if it is determined that the predetermined expiration time has expired, deletion of the first entry from the queue.

Подробнее
Номер записи: 30
08-02-2018 дата публикации

Retain locally deleted content at storage service

Номер: US20180039551A1
Автор: Adam Czeisler, John D. Rodrigues, Steven Bailey
Принадлежит: Microsoft Technology Licensing LLC

Cloud-based storage services are provided for storing and/or sharing content across multiple devices, where the content is periodically synchronized between the devices and the storage service. Conventionally, if locally stored content is deleted from a device, the delete would be propagated to the storage service causing the content to not only be deleted from the storage service but from any other devices where the content was locally stored and synchronized with the storage service. Embodiments are directed to retainment of locally deleted content at the storage service to prevent accidental or nefarious deletions of locally stored content on a device from further causing the content to be deleted universally from the storage service and/or multiple other devices. For example, the storage service may be configured to receive content stored locally on the device, detect a deletion of the content on the device, and retain the content at the storage service.

Подробнее
Номер записи: 31
06-02-2020 дата публикации

System And Method for Capturing Data to Provide to a Data Analyser

Номер: US20200042509A1
Автор: Knight Matthew, Pope Steven L., Riddoch David J.
Принадлежит: Solarflare Communications, Inc.

A system has data capture devices collecting data from different points in a network. The captured data is written to a data store and is directed to an output. The data from the different data capture devices can be delivered to a data analytics device. As long as the data analytics device is able to keep pace with the data that is directed to the output, that data is used by the analytics device. If the analytics device is not able to keep pace, the data written to the data store is retrieved and is used until the analytics device has caught up. 1. A data injecting arrangement comprising:an input configured to receive data from at least one data capture device, wherein said data is captured by the at least one data capture device in a first format and received from the at least one data capture device in a different format with time information;at least one buffer configured to store said data; process said received data such that said data is in said first format; and', 'provide the received data to an output in an order dependent upon the time information received with the received data,, 'at least one processor configured towherein the data injecting arrangement comprises the output, wherein the output is configured to output said received data in said first format to an application which uses said data.2. A data injecting arrangement as claimed in claim 1 , wherein the at least one processor is configured to control a rate of output of said data to said application such that said rate does not exceed a maximum output rate.3. A data injecting arrangement as claimed in claim 1 , wherein the at least one processor is configured to control a rate of output of said data to said application in dependence upon messaging received from the application.4. A data injecting arrangement as claimed in claim 1 , wherein the data comprises at least one of:a first part of said captured data from said data storage; anda second part of said data captured provided to the ...

Подробнее
Номер записи: 32
06-02-2020 дата публикации

DATA REPLICATION SYSTEM

Номер: US20200042535A1
Автор: Joel Martin Louis
Принадлежит:

An improved data replication system with goals of Recovery Point Objective of zero, meaning a zero potential for loss of data, and a Recovery Time Objective in the seconds, meaning very short downtime after a failure. The system includes duplicates of a data set preferably on multiple drives in multiple computers. Change requests are stored within duplicates, and when a change request has been stored in enough duplicates, it may be applied to any duplicate after all prior change requests have been applied to that duplicate. The system applies changes to duplicates of a data set in the same order. The system further includes a replicator operable to implement accessing and changing steps to meet the goals. 1. A system for improving computer operations and data safety , the system enabling data replication with improved data loss prevention and time to recovery , the system comprising:a plurality of duplicates of a data set, the plurality of duplicates comprising a first duplicate and a second duplicate, wherein the first duplicate may be changed so that the data set on the first duplicate no longer exactly matches the data set on the second duplicate;a non-transient computer-readable memory device storing at least one portion of a duplicate in the plurality of duplicates; processing a retrieval request for data of the data set;', 'processing a request to change the data set;', 'assigning unique metadata to each request to change the data set, said unique metadata specifying a sequence to apply each request to change said data set;', 'storing in any duplicate of the data set a representation of each request to change that data set and the unique metadata assigned to each such request to change that data set;', 'storing in any duplicate of the data set an indication of which request to change that data set was applied last in said duplicate;', a specified minimum count of such duplicates storing the request to change the data set,', 'a specified required combination of ...

Подробнее
Номер записи: 33
18-02-2021 дата публикации

EXECUTING A CONDITIONAL COMMAND ON AN OBJECT STORED IN A STORAGE SYSTEM

Номер: US20210049129A1
Автор: Sawhney Aditya
Принадлежит: ORACLE INTERNATIONAL CORPORATION

Each object is associated with one root metadata record and one or more version-specific metadata records, each corresponding to a version of object data. A conditional command may be conditioned upon whether an object is stored in a storage system. Whether the condition is satisfied is determined based on whether a root metadata record of the object exists. If the condition is satisfied, then metadata is updated to reflect execution of the conditional command. A conditional command may be conditioned upon whether a data version identifier or a metadata version identifier equals a particular value. A conditional command execution engine retrieves the relevant version identifier from a version-specific metadata record, and performs a check on whether the condition is satisfied. If the condition is satisfied, the engine ensures that the version-specific record has not been modified during the check, and updates metadata to reflect execution of the conditional command. 1. One or more non-transitory computer readable media storing instructions , which , when executed by one or more hardware processors , cause:receiving a first conditional command to store a new version of metadata, if a metadata version identifier of a current version of the metadata comprises a first specified value, wherein the metadata corresponds to a first version of object data of a first object in a storage system;determining that a first record, of a plurality of records in the storage system, is associated with the first object;retrieving, from the first record, (a) the metadata version identifier of the current version of the metadata and (b) a system version identifier of the first record;performing a first verification to verify whether the metadata version identifier of the current version of the metadata comprises the first specified value;performing a second verification to verify whether the system version identifier of the first record, obtained currently as part of performing the ...

Подробнее
Номер записи: 34
16-02-2017 дата публикации

Application of search policies to searches on event data stored in persistent data structures

Номер: US20170046403A1
Автор: Andre David Stechert, Bradley Hall, Brian Philip Murphy, Erik M. Swan, Michael Joseph Baum, Nicholas Christian Mealy, R. David Carasso, Robin Kumar Das, Rory Greene, Stephen Phillip Sorkin
Принадлежит: Splunk Inc

Methods and apparatus consistent with the invention provide the ability to organize, index, search, and present time series data based on searches. Time series data are sequences of time stamped records occurring in one or more usually continuous streams, representing some type of activity. In one embodiment, time series data is organized into discrete events with normalized time stamps and the events are indexed by time and keyword. A search is received and relevant event information is retrieved based in whole or in part on the time indexing mechanism, keyword indexing mechanism, or statistical indices calculated at the time of the search.

Подробнее
Номер записи: 35
03-03-2022 дата публикации

SYSTEM AND METHOD FOR AUTOMATED MAPPING OF DATA TYPES FOR USE WITH DATAFLOW ENVIRONMENTS

Номер: US20220066753A1
Автор: Allan David, Namarvar Hassan Heidari, Seetharaman Ganesh, Stojanovic Alexander Sasha
Принадлежит:

In accordance with various embodiments, described herein is a system (Data Artificial Intelligence system, Data AI system), for use with a data integration or other computing environment, that leverages machine learning (ML, DataFlow Machine Learning, DFML), for use in managing a flow of data (dataflow, DF), and building complex dataflow software applications (dataflow applications, pipelines). In accordance with an embodiment, the system can provide support for auto-mapping of complex data structures, datasets or entities, between one or more sources or targets of data, referred to herein in some embodiments as HUBs. The auto-mapping can be driven by a metadata, schema, and statistical profiling of a dataset; and used to map a source dataset or entity associated with an input HUB, to a target dataset or entity or vice versa, to produce an output data prepared in a format or organization (projection) for use with one or more output HUBs.

Подробнее
Номер записи: 36
03-03-2022 дата публикации

Moving Window Data Deduplication in Distributed Storage

Номер: US20220067006A1
Автор: Edara Pavan, Li Bigang, Padinker Pavlo
Принадлежит:

The present disclosure describes a service which provides primary in-line deduplication. A streaming application program interface (API) may allow for streaming records into a storage system with high throughput and low latency. As part of this process, the API allows user to add identifiers as a field used for data deduplication. The deduplication service keeps a moving window of the identifiers in memory and does in-line deduplication by quickly determining whether data is a duplicate. Keeping only deduplication keys in memory reduces the cost of running the service. Moreover, the real-time nature of the moving window approach allows for storing deduplication information alongside the data and accessing it immediately on read. In this regard, read after write consistency is supported, and costs are reduced.

Подробнее
Номер записи: 37
03-03-2022 дата публикации

DATA INSIGHTS

Номер: US20220067021A1
Автор: RAHLE Bruno
Принадлежит:

A data insight system generates an index of precalculated statistical attributes associated with massive data files, such as network log data, that allows improved access to statistical attributes associated with the data items. The system may partition time-based data items into segments based on one or more metadata criteria (e.g., product, status, deployment, environment, version, host, etc.), such as may be selected by a user. The system may then group the data items by time intervals (e.g., 1 minute, 60 minutes, 24 hours, etc.), and calculate one or more statistical attributes (e.g., sum, average, standard deviation, etc.) for each of the segments within each of the time windows. This statistical data may then be stored in association with the corresponding segment and time interval for access by one or more front end software applications.

Подробнее
Номер записи: 38
03-03-2022 дата публикации

METHOD, APPARATUS, DEVICE AND STORAGE MEDIUM FOR GENERATING AND PROCESSING A DISTRIBUTED GRAPH DATABASE

Номер: US20220067047A1
Автор: Wang Chenguang, WANG Yujue, WU Yiwei, YE Xiaomeng
Принадлежит: Vesoft. Inc

A UUID generation method for a distributed graph database, and a data processing method and apparatus for the distributed graph database. The UUID generation method for the distributed graph database comprises the following steps: receiving a UUID generation request, wherein the UUID generation request comprises an input field and a partition number of the input field; calling a Murmur hash function to generate an initial UUID according to the input field and the partition number of the input field; querying whether a duplicate key value exists between the initial UUID and a historical UUID to obtain a query result; and obtaining a target UUID for storage according to the query result and the initial UUID.

Подробнее
Номер записи: 39
03-03-2022 дата публикации

Transition to an organization directory

Номер: US20220067066A1
Автор: Aaron Staley, Akos Albert, Conor WOODS, Nils Bunger, Sam Jau, Thomas Kleinpeter, Tony Xu
Принадлежит: Dropbox Inc

The present technology pertains to a organization directory hosted by a synchronized content management system. The corporate directory can provide access to user accounts for all members of the organization to all content items in the organization directory on the respective file systems of the members' client devices. Members can reach any content item at the same path as other members relative to the organization directory root on their respective client device. In some embodiments novel access permissions are granted to maintain path consistency.

Подробнее
Номер записи: 40
25-02-2016 дата публикации

Multi-user search system with methodology for personal searching

Номер: US20160055248A1
Автор: ABHISHEK Agrawal, Franck Chastagnol, Samir Goel
Принадлежит: Dropbox Inc

A multi-user search system with methodology for personal searching. In one embodiment, for example, a system for personal searching includes a plurality of index servers storing a plurality of index shards. Each index shard of the plurality of index shards indexes a plurality of documents. Each document of the plurality of documents belongs to one of a plurality of document namespaces assigned to the index shard. The system further includes a front-end server computer for receiving a search query from an authenticated user; an access control server for determining an authorized document namespace the authenticated user is authorized to access; and a query processor for answering the search query and restricting, based on an identifier of the authorized document namespace, an answer to the search query to identifying only documents satisfying the search query and belonging to the authorized document namespace.

Подробнее
Номер записи: 41
13-02-2020 дата публикации

SYSTEM AND METHOD OF DETECTING WHETHER A SOURCE OF A PACKET FLOW TRANSMITS PACKETS WHICH BYPASS AN OPERATING SYSTEM STACK

Номер: US20200052984A1
Автор: Chang Shih-Chun, Deen Khawar, Gandham Shashidhar, Gupta Anubhav, Prasad Rohit Chandra, Singh Abhishek Ranjan, Yadav Navindra
Принадлежит:

A method includes capturing first data associated with a first packet flow originating from a first host using a first capture agent deployed at the first host to yield first flow data, capturing second data associated with a second packet flow originating from the first host from a second capture agent deployed on a second host to yield second flow data and comparing the first flow data and the second flow data to yield a difference. When the difference is above a threshold value, the method includes determining that the second packet flow was transmitted by a component that bypassed an operating stack of the first host or a packet capture agent at the device to yield a determination, detecting that hidden network traffic exists, and predicting a malware issue with the first host based on the determination. 1. A method comprising:capturing data associated with a plurality of packet flows originating from a plurality of hosts;analyzing the data to determine a difference; andwhen the difference is determined, determining a portion of the data includes hidden network traffic transmitted by bypassing a device.2. The method of claim 1 , wherein the data includes metadata associated with a first packet flow of the plurality of packet flows and a second packet flow of the plurality of packet flows.3. The method of claim 2 , wherein the data includes first packet content of the first packet flow and second packet content of the second packet flow.4. The method of claim 1 , wherein the data includes network data.5. The method of claim 1 , wherein the analyzing includes comparing the data.6. The method of claim 1 , further comprising:performing a corrective action when the difference is determined.7. The method of claim 6 , wherein the corrective action includes requiring all packets to and from a first one of the plurality of hosts to flow through an operating stack of the first one of the plurality of hosts.8. The method of claim 6 , wherein the corrective action includes ...

Подробнее
Номер записи: 42
10-03-2022 дата публикации

LOGFILE COLLECTION AND CONSOLIDATION

Номер: US20220075769A1
Автор: Shuster Boaz
Принадлежит:

Mechanisms for consolidating log information from remote computing devices are provided. Connections with a plurality of remote computing devices are established. Each remote computing device has a corresponding logfile. For a plurality of iterations, logfile contents from each logfile on each remote computing device are retrieved, and the logfile contents are sent to a centralized monitoring service. 1. A method for consolidating logfile contents from remote computing devices , comprising:establishing, by a computing device comprising a processor device via a network, connections with a plurality of remote computing devices, each remote computing device having a corresponding logfile; and for each remote computing device, accessing logfile meta data that identifies attributes of the corresponding logfile;', 'for each remote computing device, based on the logfile meta data, retrieving logfile contents from each logfile on each remote computing device that were not previously retrieved; and', 'sending the logfile contents to a centralized monitoring service., 'for a plurality of iterations, by the computing device via the network2. The method of wherein claim 1 , for the plurality of iterations claim 1 , retrieving the logfile contents from each logfile on each remote computing device further comprises:determining from the logfile meta data that the logfile has a new logfile status or an old logfile status;if the logfile has the new logfile status, retrieving all the logfile contents of the logfile; andif the logfile has the old logfile status, retrieving the logfile contents of the logfile that have been added to the logfile since the logfile was previously accessed.3. The method of wherein retrieving all the logfile contents further comprises determining a total number of lines of the logfile and storing the total number of lines in a memory.4. The method of wherein retrieving the logfile contents of the logfile that have been added to the logfile since the logfile ...

Подробнее
Номер записи: 43
10-03-2022 дата публикации

DYNAMIC SELECTION OF SYNCHRONIZATION UPDATE PATH

Номер: US20220075770A1
Автор: Beier Felix, Butterstein Dennis, Lueck Einar, Perathoner-Tschaffler Sabine
Принадлежит:

A method comprises receiving a stream of change log records from a source database system; generating change statistics based on a number of pending changes per table partition according to the change log records; estimating, based on performance statistics, a first amount of time for applying the pending changes to a target database system using an incremental update path; estimating, based on the performance statistics, a second amount of time for applying the pending changes to the target database using a bulk update path; dynamically selecting, based on comparison of the first amount of time with the second amount of time, one of the incremental update path and the bulk update path for applying the pending changes to the target database system; and applying the pending changes to the target database system using the selected update path. 1. A method comprising:receiving a stream of change log records from a source database system;generating change statistics based on a number of pending changes per table partition according to the change log records;estimating, based on performance statistics, a first amount of time for applying the pending changes to a target database system using an incremental update path;estimating, based on the performance statistics, a second amount of time for applying the pending changes to the target database using a bulk update path;dynamically selecting, based on comparison of the first amount of time with the second amount of time, one of the incremental update path and the bulk update path for applying the pending changes to the target database system; andapplying the pending changes to the target database system using the selected update path.2. The method of claim 1 , wherein each change log record comprises a log sequence number (LRSN) claim 1 , a timestamp claim 1 , a table ID claim 1 , a partition ID claim 1 , and attribute changes for the corresponding record.3. The method of claim 2 , wherein applying the pending changes ...

Подробнее
Номер записи: 44
21-02-2019 дата публикации

Adaptive learning based on electroencephalographic data

Номер: US20190056438A1
Автор: Joseph A. Jaroch
Принадлежит: Colossio Inc

Systems and a method for adaptive learning style curriculum tailoring through electroencephalography (EEG) are provided. In one or more aspects, a system includes one or more devices to capture raw EEG data associated with one or more first persons attending an information exchange session. A first processor can perform a first processing of the captured raw EEG data to generate EEG frequency data. A communication circuit communicates the EEG frequency data to a central processor. The central processor can process the EEG frequency data to generate a feedback related to attentiveness of the one or more first persons. The feedback can enable a second person to adapt one or more materials presented in the information exchange session based on the feedback for enhanced audience attentiveness.

Подробнее
Номер записи: 45
04-03-2021 дата публикации

GAS EMISSION REDUCING SYSTEM AND METHOD FOR REDUCING AT LEAST ONE OF GREEN HOUSE GASES AND AMMONIA EMISSIONS FROM SLURRY STORED IN ONE OR MORE SLURRY STORAGE TANKS

Номер: US20210061726A1
Автор: TOFT MORTEN
Принадлежит:

A system and a method for reducing emission of greenhouse gasses is provided, in particular at least one of methane, laughing gas, nitrogen oxides, and ammonia from slurry stored in one or more slurry storage tanks. The method includes continuously maintaining slurry stored in a slurry storage tank under acidic conditions. The method includes the steps of: A: monitoring pH in the slurry present in the slurry storage tank by one or more pH sensors arranged in contact with the slurry in the slurry storage, B: checking if the detected pH exceeds above an upper threshold, such as an upper threshold set at pH=7, C: activate acid addition when the monitored pH exceeds the upper threshold, D: while stirring, adding acid until pH in the slurry is adjusted to within a range between the upper threshold and a lower threshold, such as between pH=2 and pH=7, in particular between pH=5 to pH=7, or more preferred pH=5 and pH=6, and repeating steps C-D when the detected pH of step A exceeds the upper threshold. 1. A method for reducing emission of greenhouse gasses or at least one of methane , laughing gas , nitrogen oxides , and ammonia from slurry stored in one or more slurry storage tanks , which method comprises continuously maintaining slurry stored in a slurry storage tank under acidic conditions , and wherein the method includes the steps ofA: monitoring pH in the slurry present in the slurry storage tank by one or more pH sensors arranged in contact with the slurry in the slurry storage,B: checking if the detected pH exceeds above an upper threshold, such as an upper threshold set at pH=7,C: activate acid addition when the monitored pH exceeds the upper threshold,D: while stirring, adding acid until pH in the slurry is adjusted to within a range between the upper threshold and a lower threshold, wherein the upper threshold and a lower threshold is one of between pH=2 and pH=7, between pH=5 to pH=7, or between pH=5 and pH=6, and repeating steps C-D when the step detected pH ...

Подробнее
Номер записи: 46
02-03-2017 дата публикации

Method and system for merging data

Номер: US20170060937A1
Автор: Ayan Ray, Bhautik Joshi, Peter Welch
Принадлежит: Yahoo Inc until 2017

The present teaching relates to methods, systems, and programming for reconciling or merging real time data with bulk data. In one example, a first attribute value is obtained. The first attribute value characterizes an aspect of a data item. A second attribute value related to the first attribute value is obtained. The second attribute value characterizes the aspect of the data item. A scheme is selected to be used to determine a third attribute value to characterize the data item. The third attribute value is determined in accordance with the selected scheme as well as the first and second attribute values.

Подробнее
Номер записи: 47
04-03-2021 дата публикации

NO-SQL REPOSITORY DATABASE AND ITS USE FOR AUTOMATION SERVICES REQUESTS PROCESSING

Номер: US20210064587A1
Автор: VAN SURKSUM Jorrit
Принадлежит:

The invention concerns a No-SQL repository dataBase (RepoDB (B)) for handling multiple legacy environments and registering a wide variety of configurations (software and hardware, and cloud) by storing technical data to support the end-to-end (E2E) automation and authorization of standard service requests (SSR) and wherein a table stored in RepoDB (B) is configured to hold data in No-SQL format and for providing managed services (standard service requests) in very complex environments using at least one other database (Oracle or Mysql or MS SQL or DB2) and for the automation of database SSR. 11212. A No-SQL repository DataBase (RepoDB (B)) for handling multiple legacy environments and registering a wide variety of configurations (software and hardware , and cloud) by storing technical data to support the end-to-end (E2E) automation and authorization of standard service requests (SSR) and wherein a table stored in RepoDB (B) is configured to hold data in No-SQL format and for providing managed services (standard service requests) in very complex environments using at least one other database (Oracle or Mysql or MS SQL or DB2) and for the automation of Database SSR's.2. A No-SQL repository database according to claim 1 , wherein the No-SQL format used is JSON (JavaScript Object Notation).312. A No-SQL repository database according to claim 1 , wherein each line of the stored RepoDB (B) table defines configuration items (CI) corresponding to a system identity (with the attribute sys_id) and including the creator name and date of creation claim 1 , the updater name and date of update claim 1 , the type of system (host claim 1 , instance claim 1 , software set claim 1 , database) and a string of technical detail data in JSON format.41212121. A No-SQL repository database (RepoDB (B)) according to claim 3 , wherein the RepoDB (B) is configured for storing technical data concerning CI (Configuration Items or Control Instances) in RepoDB (B) and sending this data to a GUI ( ...

Подробнее
Номер записи: 48
04-03-2021 дата публикации

Legal timeline analytics

Номер: US20210065323A1
Автор: Brian C. Howard, Gavin Carothers, John Lehmann, Karl Harris, Nicholas O. Pilon, Timothy Wade Malone
Принадлежит: Lex Machina Inc

Various of the disclosed embodiments concern systems and methods for applying legal analytics. In some embodiments, a legal analytics platform retrieves legal data from an electronic database, analyzes some or all of the legal data, and identifies interesting patterns and results of statistical analyses. In order to permit searching of the legal data, metadata elements or tags can be generated for legal entities and legal events. In some embodiments, the legal analytics platform identifies timestamps in the legal data and performs time-based statistical analysis. Results of the statistical analyses can be presented to a user via a graphical user interface (GUI), which may also allow the user to interact with the legal analytics platform and search one or more databases of legal data.

Подробнее
Номер записи: 49
10-03-2016 дата публикации

Stateless datastore-independent transactions

Номер: US20160070740A1
Автор: Allan Henry Vermeulen, Kiran-Kumar Muniswamy-Reddy, Timothy Andrew Rath, Timothy Daniel Cole
Принадлежит: Amazon Technologies Inc

At a client-side component of a storage group, a read descriptor generated in response to a read request directed to a first data store is received. The read descriptor includes a state transition indicator corresponding to a write that has been applied at the first data store. A write descriptor indicative of a write that depends on a result of the read request is generated at the client-side component. The read descriptor and the write descriptor are included in a commit request for a candidate transaction at the client-side component, and transmitted to a transaction manager.

Подробнее
Номер записи: 50
10-03-2016 дата публикации

Maintaining a relationship between two different items of data

Номер: US20160070774A1
Автор: Albert B. Barabas, Ernst M. Siepmann, Mark D.A. van Gulik
Принадлежит: Miosoft Corp

Data is stored persistently. At least two different items of the data are stored in two different non-conflicting regions or two different physical clusters. A relationship is maintained between the two different items of data. The relationship enables a process to reach any one of the data items from the other data item. Consistency of the relationship is maintained notwithstanding updates of either or both of the items.

Подробнее
Номер записи: 51
10-03-2016 дата публикации

Referencing change(s) in data utilizing a network resource locator

Номер: US20160072926A1
Автор: Alex James, Jason Clark, Lance Olson, Michael Pizzo, Mike Flasko, Pablo Castro, Sid Jayadevan
Принадлежит: Microsoft Technology Licensing LLC

The subject disclosure relates to techniques for referencing a change in data utilizing a network resource locator. An interface component can receive one or more requests that are associated with a data set from a client, and send, based on the one or more requests, a network resource locator and at least one portion of the data set to the client. Further, a data service component can compute a parameter that is associated with a change of the data set, and include the parameter in the network resource locator. In other embodiments, the data service component can receive a request utilizing the network resource locator, determine the change of the data set based on the parameter, and send the change of the data set to the client.

Подробнее
Номер записи: 52
24-03-2022 дата публикации

Playback Devie

Номер: US20220091814A1
Автор: Millington Nicholas A.J.
Принадлежит:

A system is described for maintaining synchrony of operations among a plurality of devices that have independent clocking arrangements. The system includes a task distribution device that distributes tasks to a synchrony group comprising a plurality of devices that are to perform the tasks distributed by the task distribution device in synchrony. The task distribution device distributes each task to the members of the synchrony group over a network. Each task is associated with a time stamp that indicates a time, relative to a clock maintained by the task distribution device, at which the members of the synchrony group are to execute the task. Each member of the synchrony group periodically obtains from the task distribution device an indication of the current time indicated by its clock, determines a time differential between the task distribution device's clock and its respective clock and determines therefrom a time at which, according to its respective clock, the time stamp indicates that it is to execute the task. 1. A first data network device comprising:one or more processors; andtangible, non-transitory computer-readable media comprising program instructions that are executable by the one or more processors such that the first data network device is configured to:receive control information from a second data network device over an asynchronous data network configured to exchange digital data packets, wherein the received control information comprises a direction for the first data network device to enter into a synchrony group with at least a third data network device; and wherein in the synchrony group, the first data network device and the third data network device are configured to playback audio in synchrony based at least in part on (i) audio content, (ii) playback timing information associated with the audio content, wherein the playback timing information is generated by one of the first data network device or the third data network device, and (iii) ...

Подробнее
Номер записи: 53
24-03-2022 дата публикации

CONCURRENT TRANSACTION PROCESSING IN A DATABASE SYSTEM

Номер: US20220092050A1
Автор: Luo Chen, Miller Alexander, Waddington William, Zhang Zhaohui
Принадлежит:

The subject technology inserts, by a first transaction, a new version of an object, the inserting corresponding to a first statement from the first transaction, the first statement including information indicating a first key, a first transaction identifier, a first statement number, and a first restart count. The subject technology performs, by a second transaction, a range read, the range read including information indicating the first key. The subject technology receives, after performing the range read, a set of conflicting transactions. The subject technology determines that a conflict occurred between the first transaction and a third transaction from the set of conflicting transactions. 1. A system comprising:at least one hardware processor; anda memory storing instructions that cause the at least one hardware processor to perform operations comprising:inserting, by a first transaction, a new version of an object, the inserting corresponding to a first statement from the first transaction, the first statement including information indicating a first key, a first transaction identifier, a first statement number, and a first restart count;performing, by a second transaction, a range read, the range read including information indicating the first key;receiving, after performing the range read, a set of conflicting transactions; anddetermining that a conflict occurred between the first transaction and a third transaction from the set of conflicting transactions.2. The system of claim 1 , wherein the operations further comprise:determining that a fourth transaction from the set of conflicting transactions has committed before a read timestamp of the first transaction, anddetermining that the first transaction and the fourth transaction do not have a write-write conflict.3. The system of claim 1 , wherein determining that the conflict occurred between the first transaction and the third transaction comprises:determining that the third transaction from the set of ...

Подробнее
Номер записи: 54
24-03-2022 дата публикации

CONCURRENT TRANSACTION PROCESSING IN A DATABASE SYSTEM

Номер: US20220092051A1
Автор: Miller Alexander, Waddington William
Принадлежит:

The subject technology receives a first transaction. The subject technology assigns a first read version to the first transaction, the first read version indicating a first version of the linearizable storage. The subject technology performs a read operation from the first transaction on a table in a database. The subject technology determines a first commit version identifier corresponding to first data resulting from the read operation. The subject technology, in response to determining that a particular write operation is absent from the first transaction, proceeding to execute a different transaction and foregoing to perform a commit process in connection with the first transaction. 1. A system comprising:at least one hardware processor; anda memory storing instructions that cause the at least one hardware processor to perform operations comprising:receiving a first transaction, the first transaction to be executed on linearizable storage;assigning a first read version to the first transaction, the first read version indicating a first version of the linearizable storage;performing a read operation from the first transaction on a table in a database;determining a first commit version identifier corresponding to first data resulting from the read operation; andin response to determining that a particular write operation is absent from the first transaction, proceeding to execute a different transaction and foregoing to perform a commit process in connection with the first transaction.2. The system of claim 1 , wherein the operations further comprise:receiving a second transaction, the second transaction to be executed on the linearizable storage;assigning the second transaction a second read version, the second read version indicating a second version of the linearizable storage;performing a second read operation from the second transaction on the table in the database; andperforming a write operation from the second transaction on the table in the database.3. ...

Подробнее
Номер записи: 55
18-03-2021 дата публикации

IMAGE-BASED PRODUCTIVITY TRACKING SYSTEM

Номер: US20210079627A1
Автор: SUBRAMANIAN Gautham
Принадлежит: CATERPILLAR INC.

A work machine including a sensing device, a user interface, and a control unit is disclosed. The control unit may be configured to generate a productivity layer based on productivity data, and generate an image layer based on image data. The image data may include information relating to an image corresponding to a state of an operation associated with a worksite and a geospatial reference associated with the image. The control unit may be configured to generate a composite image of the worksite based on a map layer, the image layer, and the productivity layer, and cause the composite image to be displayed via the user interface. The composite image may position the image layer relative to the map layer based on the geospatial reference and geographical coordinates corresponding to the geospatial reference, and position the productivity layer relative to the image layer. 1. A method , comprising: 'the map data including information relating to a geographical attribute associated with the worksite and geographical coordinates associated with the geographical attribute;', 'receiving, by a device, map data associated with a worksite,'} 'the productivity data including information relating to a state of an operation associated with the worksite;', 'receiving, by the device, productivity data associated with the worksite,'} 'the image data including information relating to an image corresponding to the state of the operation and a geospatial reference associated with the image;', 'receiving, by the device, image data associated with the worksite,'}generating, by the device, a map layer based on the map data;generating, by the device, an image layer based on the image data;generating, by the device, a productivity layer based on the productivity data; 'the composite image positioning the image layer relative to the map layer based on the geospatial reference and geographical coordinates corresponding to the geospatial reference, and positioning the productivity layer ...

Подробнее
Номер записи: 56
18-03-2021 дата публикации

LOG-STRUCTURED STORAGE SYSTEMS

Номер: US20210081396A1
Автор: Tian Shikun
Принадлежит: Advanced New Technologies Co., Ltd.

Disclosed herein are methods, systems, and apparatus, including computer programs encoded on computer storage devices, for data processing and storage. One of the methods includes receiving, by a storage system, a plurality of write requests for storing a respective plurality of blockchain data in the storage system. Each of the plurality of the blockchain data includes: a value of one or more of a block, a transaction, or a state of a blockchain network, and a key corresponding to the value. The storage system appends the plurality of the blockchain data to a data log file according to a chronological order of the plurality of the blockchain data, and refrains from sorting the plurality of the blockchain data in the data log file according to respective keys of values in the plurality of the blockchain data. 1. A computer-implemented method comprising: a value of at least one block in the blockchain of the blockchain network, and', 'a key corresponding to the value;, 'receiving, by a storage system of a network node of a blockchain network, a write request for storing a plurality of blockchain data in the storage system, wherein the blockchain network comprises a blockchain, wherein the plurality of blockchain data comprise data that are related to the blockchain and that are generated in the blockchain network, wherein the storage system is configured to store the plurality of blockchain data in one or more data log files and one or more index log files, and wherein each of the plurality of the blockchain data comprisesappending, by the storage system, the plurality of the blockchain data to the one or more data log files in the storage system according to a chronological order of the plurality of the blockchain data, wherein the one or more data log files are stored in a first-tier storage device in the storage system, and wherein the one or more data log files store the plurality of the blockchain data, the plurality of the blockchain data have respective ...

Подробнее
Номер записи: 57
31-03-2022 дата публикации

Method and apparatus for simplifying garbage collection operations in host-managed drives

Номер: US20220100652A1
Автор: Fei Liu, Sheng Qiu
Принадлежит: Alibaba Group Holding Ltd

The present disclosure provides methods, systems, and non-transitory computer readable media for optimizing garbage collection operations. An exemplary method comprises receiving an update operation on data to be stored in a host-managed drive in a data storage system; inserting the update operation in a local storage of a host of the data storage system; marking one or more obsolete versions of the data in the local storage; and performing, by a translation layer corresponding to the host-managed drive, a garbage collection operation on the host-managed drive, wherein the garbage collection operation removes the one or more obsolete versions of the data marked in the local storage according to the update operation, and the translation layer comprises address mapping information between the host and the host-managed drive.

Подробнее
Номер записи: 58
31-03-2022 дата публикации

DEDUPLICATED MERGED INDEXED OBJECT STORAGE FILE SYSTEM

Номер: US20220100708A1
Автор: ACHARYA YOGENDRA, Agarwal Anup, Agrawal Aditya, Apte Anand, Borate Milind, Jain Somesh, Kelkar Aditya, Kulkarni Amit, Kumar Alok
Принадлежит:

A file system may include an object storage, a merged index, and a distributed database. When a file is stored in the file system, the file may be converted to an object and be stored in the object storage. The deduplication index of the file may be stored in the distributed database. The namespace metadata of the file may be stored in the merged index. The merged index generates namespace entries of the file when the file is created, deleted, and/or modified. A namespace entry may be associated with a specific file and may include a creation version and a deletion version. When a file is deleted or modified, instead of modifying the existing namespace entries, new entries associated with different versions and including different creation or deletion versions are created. The status of a file may be monitored by one or more entries associated with a file. 1. A method for operating a file system , the method comprising:generating, responsive to a creation of a first version of a file captured in a first snapshot, a first namespace entry associated with the first version, the first namespace entry comprising a first creation version corresponding to the first snapshot;generating, responsive to a modification of the file from the first version to a second version captured in a second snapshot, a second namespace entry associated with the first version, the second namespace entry comprising a second creation version corresponding to the first snapshot and a second deletion version corresponding to the second snapshot; andgenerating a third namespace entry associated with the second version, the third namespace entry comprising a third creation version corresponding to the second snapshot and a third deletion version corresponding to no snapshot.2. The method of claim 1 , wherein the first namespace entry is included in a first object that is stored in an object storage and the second namespace entry is included in a second object that is stored in the object storage ...

Подробнее
Номер записи: 59
12-03-2020 дата публикации

DEDUPLICATED DATA DISTRIBUTION TECHNIQUES

Номер: US20200081798A1
Автор: Allison Damon, Armstrong Brad, Bispala Brian, Dornquast Matthew, Lindquist Peter John, Lonergan Rory, Parker Christopher, Scorcio Marshall
Принадлежит:

In connection with a data distribution architecture, client-side “deduplication” techniques may be utilized for data transfers occurring among various file system nodes. In some examples, these deduplication techniques involve fingerprinting file system elements that are being shared and transferred, and dividing each file into separate units referred to as “blocks” or “chunks.” These separate units may be used for independently rebuilding a file from local and remote collections, storage locations, or sources. The deduplication techniques may be applied to data transfers to prevent unnecessary data transfers, and to reduce the amount of bandwidth, processing power, and memory used to synchronize and transfer data among the file system nodes. The described deduplication concepts may also be applied for purposes of efficient file replication, data transfers, and file system events occurring within and among networks and file system nodes. 1. (canceled)2. A method for constructing a target object to a computing node using a storage system that is configured to store partitions of the target object in one or more data components , the method comprising:retrieving identifiers of the one or more data components;identifying, based on the received identifiers, a first data component of the one or more data components that is stored locally on the computing node;transferring a subset of the one or more data components to the computing node, the subset of the one or more data components excluding the first data component; andcausing the computing node to construct the target object using the stored first data component and the transferred subset of the one or more data components.3. The method of claim 1 , further comprising retrieving the identifiers in response to a request to:distribute the target object to the computing node; orrestore the target object to the computing node.4. The method of claim 2 , wherein the target object comprises a collection of one or more file ...

Подробнее
Номер записи: 60
31-03-2016 дата публикации

Shared file system predictive storage techniques

Номер: US20160092465A1
Автор: Brian Bispala, Christopher Gwinn, Justin Grammens, Matthew Dornquast, Peter Lindquist, Samuel Schroeder, Thomas (Tony) Lindquist
Принадлежит: Code 42 Software Inc

Disclosed in some examples are predictive storage techniques for use in a distributed data system. The predictive storage techniques may be used to manage locally stored elements of a shared data collection, such as the storage of files on nodes of the distributed data system that are limited in local storage space. The predictive storage techniques may achieve a balance between consumption of local resources and timely access of important elements in the shared data collection. For example, the predictive storage techniques may be used for keeping or pre-caching certain items of a collection that are determined as likely to be used in local storage for convenient access, and allowing access the remaining items on request over a network.

Подробнее
Номер записи: 61
05-05-2022 дата публикации

Faster access for compressed time series data: the block index

Номер: US20220138173A1
Автор: Daniel James Farrar, Gordon GAUMNITZ, Ivan Bowman, Lars Dannecker, Robert Schulze
Принадлежит: SAP SE

A system and method for faster access for compressed time series data. A set of blocks are generated based on a table stored in a database of the data platform. The table stores data associated with multiple sources of data provided as consecutive values, each block containing index vectors having a range of the consecutive values. A block index is generated for each block having a field start vector representing a starting position of the block relative to the range of consecutive values, and a starting value vector representing a value of the block at the starting position. The field start vector of the block index is accessed to obtain the starting position of a field corresponding to a first block and to the range of the consecutive values of the first block. The starting value vector is then determined from the block index to determine an end and a length of the field of the first block.

Подробнее
Номер записи: 62
30-03-2017 дата публикации

Replication using deduplicated secondary copy data

Номер: US20170090773A1
Автор: Joe Sabu Thyvelikkakakth JOB, Manoj Kumar Vijayan
Принадлежит: Commvault Systems Inc

An information management system according to certain aspects uses backup copies or other secondary copies of production data for the purposes of replicating production data to another client. The secondary copies can be deduplicated copies. By utilizing available secondary copies of the data for replication, the system can reduce the impact on the production machines associated with replication. Utilizing deduplicated copies not only reduces the amount of stored data, but also reduces the amount of data that is communicated between the source and the destination, increasing the speed of the replication process.

Подробнее
Номер записи: 63
19-06-2014 дата публикации

Main-memory database checkpointing

Номер: US20140172803A1
Автор: Cristian C. Diaconu, Marcel van der Holst, Michael James Zwilling, Ryan L. Stonecipher
Принадлежит: Microsoft Corp

The present invention extends to methods, systems, and computer program products for main-memory database checkpointing. Embodiments of the invention use a transaction log as an interface between online threads and a checkpoint subsystem. Using the transaction log as an interface reduces synchronization overhead between threads and the checkpoint subsystem. Transactions can be assigned to files and storage space can be reserved in a lock free manner to reduce overhead of checkpointing online transactions. Meta-data independent data files and delta files can be collapsed and merged to reduce storage overhead. Checkpoints can be updated incrementally such that changes made since the last checkpoint (and not all data) are flushed to disk. Checkpoint I/O is sequential, helping ensure higher performance of physical I/O layers. During recovery checkpoint files can be loaded into memory in parallel for multiple devices.

Подробнее
Номер записи: 64
05-05-2022 дата публикации

IDENTIFYING BOGON ADDRESS SPACES

Номер: US20220141103A1
Автор: Deen Khawar, Gandham Shashidhar, Malhotra Varun Sagar, Prasad Rohit Chandra, Singh Abhishek Ranjan, Yadav Navindra
Принадлежит:

Systems, methods, and computer-readable media for identifying bogon addresses. A system can obtain an indication of address spaces in a network. The indication can be based on route advertisements transmitted by routers associated with the network. The system can receive a report generated by a capturing agent deployed on a host. The report can identify a flow captured by the capturing agent at the host. The system can identify a network address associated with the flow and, based on the indication of address spaces, the system can determine whether the network address is within the address spaces in the network. When the network address is not within the address spaces in the network, the system can determine that the network address is a bogon address. When the network address is within the address spaces in the network, the system can determine that the network address is not a bogon address.

Подробнее
Номер записи: 65
19-06-2014 дата публикации

Distributed sql query processing using key-value storage system

Номер: US20140172898A1
Автор: Joshua Leners, Marcos K. Aguilera, Michael Walfish
Принадлежит: Microsoft Corp

Distributed storage systems support SQL while also providing scalability and fault tolerance by utilizing an SQL library (the SQL execution component) layered on top of a transactional key-value system (the storage component). The SQL library comprises a parser and an execution engine running at the client, while the storage component comprises a key-value system for storing the data. The SQL library parses SQL queries received from client applications and maps them to transactions on the key-value system. The key-value system stores data items identified by key and provides concurrency control mechanisms to handle concurrent transactions. The key-value system may be a distributed system with several storage servers, each attached to one or more storage devices.

Подробнее
Номер записи: 66
01-04-2021 дата публикации

HIGH FREQUENCY DATA MANAGEMENT (HFDM)

Номер: US20210097061A1
Автор: Amihod Dov, daCosta Thiago, Medan Sebastian, Ruiters-Christou Roland Arthur, Towhidi Farzad, ZINKE Arno
Принадлежит: AUTODESK, INC.

A method and system provide the ability to manage data. Property sets consisting of property set objects are created based on a schema that defines a type and a version of the objects. The property sets are organized hierarchically to form a property tree. A commit graph stores the property set objects via an append only data structure. The commit graph provides a topology of changes between states of the objects as commit nodes organized as parent commit nodes and child commit nodes. Change sets represent a change between two commit nodes. Each change set tracks changes made on the objects, and the changes specify permitted basic operations including insert, remove, or modify operations that are applied on each state to get to a next state of the objects. 1. A computer-implemented system for managing data , comprising:(a) a computer having a memory;(b) a processor executing on the computer;(c) the memory storing a computer application comprising a set of instructions, wherein the set of instructions, when executed by the processor cause the processor to perform operations; (i) the one or more property sets comprise one or more property set objects created based on a schema;', '(ii) the schema defines a type and a version of the one or more property set objects;', '(iii) the one or more property sets are organized hierarchically to form a property tree;, '(d) the computer application providing one or more property sets, wherein (i) the commit graph comprises storage for the one or more property set objects;', '(ii) the commit graph is an append only data structure;', '(iii) the commit graph comprises a topology of changes between states of the one or more property set objects;', '(iv) the commit graph comprises two or more commit nodes organized as parent commit nodes and child commit nodes;', '(v) the child commit node comprises a pointer to a parent commit node and changes to one of the property set objects;', '(vi) as a new commit node is added to the commit ...

Подробнее
Номер записи: 67
01-04-2021 дата публикации

ON-DEMAND EXECUTION OF OBJECT TRANSFORMATION CODE IN OUTPUT PATH OF OBJECT STORAGE SERVICE

Номер: US20210097083A1
Автор: Datta Ramyanshu, Harris Timothy Lawrence, Miller Kevin C.
Принадлежит:

Systems and methods are described for modifying input and output (I/O) to an object storage service by implementing one or more owner-specified functions to I/O requests. A function can implement a data manipulation, such as filtering out sensitive data before reading or writing the data. The functions can be applied prior to implementing a request method (e.g., GET or PUT) specified within the I/O request, such that the data to which the method is applied my not match the object specified within the request. For example, a user may request to obtain (e.g., GET) a data set. The data set may be passed to a function that filters sensitive data to the data set, and the GET request method may then be applied to the output of the function. In this manner, owners of objects on an object storage service are provided with greater control of objects stored or retrieved from the service. 1. A system comprising:an object storage service comprising one or more computing devices, wherein the object storage service stores a plurality of data objects; anda code execution service comprising one or more computing devices for on-demand execution of functions in an input/output (I/O) path of the object storage service; receive a request for a requested data object of the plurality of data objects, wherein the request is associated with context data representing context of the request;', 'determine that a function, associated with the requested data object, is to be executed prior to responding to the request;', 'generate a requested file handle, wherein the requested data object is readable from the object storage service using the requested file handle; and', 'send the request, the context data, and the requested file handle to the code execution service; and, 'wherein the object storage service is configured to at least receive, from the object storage service, the request for the requested data object, the context data, and the requested file handle;', 'obtain the requested data ...

Подробнее
Номер записи: 68
19-03-2020 дата публикации

IMAGE PROCESSING DEVICE CONFIGURED TO REGENERATE TIMESTAMP AND ELECTRONIC DEVICE INCLUDING THE SAME

Номер: US20200092507A1
Автор: KIM Junseok, Lee Hyunku, Park Keun Joo, ROH Yohan, RYU Hyunsurk, WOO Jooyeon
Принадлежит: SAMSUNG ELECTRONICS CO., LTD.

An image processing device includes a vision sensor and a processor. The vision sensor generates a plurality of events in which an intensity of light changes and generates a plurality of timestamps depending on times when the events occur. In addition, the processor may regenerate a timestamp of a pixel where an abnormal event occurs, based on temporal correlation of the events. 1. An apparatus comprising: receive information on a plurality of events through at least one pixel of a plurality of pixels of a vision sensor, the information including a plurality of timestamps associated with times when the plurality of the events occur and polarity information on the plurality of the events, the plurality of pixels including a target pixel and adjacent pixels around the target pixel;', 'monitor the timestamps between an event related to the target pixel and events related to the adjacent pixels;', 'determine a temporal correlation based on the timestamps; and', 'regenerate a timestamp of the event of the target pixel., 'a processor configured to,'}2. The apparatus of claim 1 , wherein the processor is configured to receive the plurality of events in a synchronous manner.3. The apparatus of claim 2 , wherein the polarity information indicates an on-event where an intensity of light increases.4. The apparatus of claim 3 , wherein the processor includes a timestamp generator configured to generate the timestamp.5. The apparatus of claim 3 , wherein the processor is further configured to generate an on-event map based on the timestamps of the target pixel and the adjacent pixels.6. The apparatus of claim 5 , wherein the processor is further configured to store the on-event map in memory.7. The apparatus of claim 6 , whereinthe processor is further configured to mark a first number on an event occurred during a first time period and to mark a second number on event occurred during a second time on the on-event map;the first number and the second number are natural numbers; ...

Подробнее
Номер записи: 69
19-03-2020 дата публикации

IMAGE PROCESSING DEVICE CONFIGURED TO REGENERATE TIMESTAMP AND ELECTRONIC DEVICE INCLUDING THE SAME

Номер: US20200092508A1
Автор: KIM Junseok, Lee Hyunku, Park Keun Joo, ROH Yohan, RYU Hyunsurk, WOO Jooyeon
Принадлежит: SAMSUNG ELECTRONICS CO., LTD.

An image processing device includes a vision sensor and a processor. The vision sensor generates a plurality of events in which an intensity of light changes and generates a plurality of timestamps depending on times when the events occur. In addition, the processor may regenerate a timestamp of a pixel where an abnormal event occurs, based on temporal correlation of the events. 1. A dynamic vision sensor comprising:an upper semiconductor chip including a pixel array, the upper semiconductor chip configured to detect a plurality of events through at least one pixel of a plurality of pixels of the dynamic vision sensor;a lower semiconductor chip on the upper semiconductor chip including a column address event representation circuit (AER), a row AER, a packetizer, and an input/output circuit; andthe row AER is configured to receive polarity information from the pixel array, and generate timestamps associated with times when the plurality of the events occur.2. The dynamic vision sensor of claim 1 , the input/output circuit is configured to transmit the polarity information and the timestamps to an application processor in a synchronous manner.3. The dynamic vision sensor of claim 2 , wherein the polarity information indicates an on-event where an intensity of light increases.4. The dynamic vision sensor of claim 3 , wherein the plurality of pixels is divided into a plurality of groups claim 3 , each of the plurality of groups including at least two or more pixels.5. The dynamic vision sensor of claim 4 , further comprising:a pixel group configured to output a column request signal to the column AER, the column request signal indicating that an event occurred.6. The dynamic vision sensor of claim 5 , wherein the lower semiconductor chip further comprises a memory.7. A dynamic vision sensor comprising:an upper semiconductor chip including a pixel array, the upper semiconductor chip configured to detect a plurality of events through at least one pixel of a plurality of ...

Подробнее
Номер записи: 70
28-03-2019 дата публикации

Atomic Updates of Versioned Data Structures

Номер: US20190095475A1
Автор: Ariel Almog, Guy Shattah
Принадлежит: MELLANOX TECHNOLOGIES LTD

Described embodiments include an apparatus that includes circuitry, configured to facilitate writing to a shared memory, and a processor. The processor is configured to compute a local current-version number by incrementing a shared current-version number that is stored in the shared memory. The processor is further configured to, subsequently to computing the local current-version number, using the circuitry, atomically write at least part of the local current-version number to a portion of the shared memory that is referenced by the local current-version number. The processor is further configured to, subsequently to atomically writing the at least part of the local current-version number, store data in the shared memory in association with the at least part of the local current-version number, and subsequently to storing the data, atomically overwrite the shared current-version number with the local current-version number. Other embodiments are also described.

Подробнее
Номер записи: 71
28-03-2019 дата публикации

MODELLING APPARATUSES, METHODS, AND SYSTEMS

Номер: US20190095557A1
Автор: Baranetz Oleg N., Sehgal Anurag, Shaikh Riaz
Принадлежит:

A method for modelling a scenario includes compiling a plurality of data sets; validating the plurality of data sets; determining model execution parameters for executing a set of models selected from among a plurality of models accessible to the modelling platform; automatically executing the set of models in accordance with the execution order to produce an output metric, where the output metric represents a cumulative result of execution of the set of models; creating a database record representative of the model execution parameters utilized to execute the set of models; and storing, by the one or more processors of the modelling platform, the database record in a database accessible to the modelling platform. 1. A method comprising:compiling, by one or more processors of a modelling platform, a plurality of data sets;validating, by the one or more processors of the modelling platform, the plurality of data sets, wherein the validating is configured to verify that each of the plurality of data sets satisfies one or more modelling criteria;determining, by the one or more processors of the modelling platform, model execution parameters for executing a set of models selected from among a plurality of models accessible to the modelling platform, wherein the model execution parameters identify one or more data sets of the plurality of data sets that are to be provided as inputs during execution of each model included in the set of models and identifying an execution order for the set of models, wherein the execution order identifies dependencies between the models included in the set of models, and wherein a dependency between a first model and a second model indicates that an output of the first model is to be provided as an input during execution of the second model;automatically executing, by the one or more processors of the modelling platform, the set of models in accordance with the execution order to produce an output metric, wherein the output metric ...

Подробнее
Номер записи: 72
01-04-2021 дата публикации

Data storage, data check, and data linkage method and apparatus

Номер: US20210099285A1
Автор: Yi Li, Zunkui ZHAO
Принадлежит: Advanced New Technologies Co Ltd

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for data tracing are provided. One of the methods includes: receiving a data backtracking request, the data backtracking request comprising a version identifier of a first data version of a target object; obtaining, from the blockchain, version identifiers of a plurality of second data versions of the target object and a plurality of data blocks in the blockchain, wherein the second data versions comprise an initial data version of the target object, and at least one of the obtained data blocks comprises a version identifier of the initial data version; and determining, based on the version identifier of the initial data version, data content corresponding to the initial data version of the target object.

Подробнее
Номер записи: 73
08-04-2021 дата публикации

EXECUTING A CONDITIONAL COMMAND ON AN OBJECT STORED IN A STORAGE SYSTEM

Номер: US20210103558A1
Автор: Sawhney Aditya
Принадлежит: ORACLE INTERNATIONAL CORPORATION

Each object is associated with one root metadata record and one or more version-specific metadata records, each corresponding to a version of object data. A conditional command may be conditioned upon whether an object is stored in a storage system. Whether the condition is satisfied is determined based on whether a root metadata record of the object exists. If the condition is satisfied, then metadata is updated to reflect execution of the conditional command. A conditional command may be conditioned upon whether a data version identifier or a metadata version identifier equals a particular value. A conditional command execution engine retrieves the relevant version identifier from a version-specific metadata record, and performs a check on whether the condition is satisfied. If the condition is satisfied, the engine ensures that the version-specific record has not been modified during the check, and updates metadata to reflect execution of the conditional command. 1. One or more non-transitory computer readable media storing instructions , which , when executed by one or more hardware processors , cause:receiving a first conditional command to store a new version of object data of a first object in a storage system, if a version identifier of a current version of the object data of the first object comprises a first specified value;determining that a first record, of a plurality of records in the storage system, is associated with the first object;retrieving, from the first record, (a) the version identifier of the current version of the object data of the first object and (b) a system version identifier of the first record;performing a first verification to verify whether the version identifier of the current version of the object data of the first object, obtained based on the retrieving operation, comprises the first specified value;performing a second verification to verify whether the system version identifier of the first record, obtained currently as part ...

Подробнее
Номер записи: 74
08-04-2021 дата публикации

STORING EVENTS DERIVED FROM LOG DATA AND PERFORMING A SEARCH ON THE EVENTS AND DATA THAT IS NOT LOG DATA

Номер: US20210103575A1
Автор: Baum Michael Joseph, Carasso R. David, Das Robin Kumar, Greene Rory, Hall Bradley, Mealy Nicholas Christian, Murphy Brian Philip, Sorkin Stephen Phillip, Stechert Andre David, Swan Erik M.
Принадлежит:

Methods and apparatus consistent with the invention provide the ability to organize, index, search, and present time series data based on searches. Time series data are sequences of time stamped records occurring in one or more usually continuous streams, representing some type of activity. In one embodiment, time series data is stored as discrete events time stamps. A search is received and relevant event information is retrieved based in whole or in part on the time stamp, a keyword indexing mechanism, or statistical indices calculated at the time of the search. 1receiving time series data streams;time stamping the time series data streams to create time stamped events;time indexing the time stamped events to create time bucketed indices;receiving a time series search request; andexecuting the time series search request at least in part by searching the time bucketed indices.. A computer-implemented method for time searching data, comprising: The present application is a continuation of U.S. patent application Ser. No. 15/963,740, filed Apr. 26, 2018; which is a continuation of U.S. patent application Ser. No. 15/661,260, filed on Jul. 27, 2017; which is a continuation of U.S. patent application Ser. No. 15/420,938, filed on Jan. 31, 2017; which is a continuation of U.S. patent application Ser. No. 14/611,170, filed on Jan. 30, 2015; which is a continuation of U.S. patent application Ser. No. 13/353,135, filed on Jan. 18, 2012; which is a continuation of U.S. patent application Ser. No. 11/868,370, filed Oct. 5, 2007; which claims priority under 35 U.S.C. § 119(e) to U.S. Provisional Patent Application No. 60/828,283, filed Oct. 5, 2006. The subject matter of all of the foregoing is incorporated herein by reference in its entirety.This invention relates generally to information organization, search, and retrieval and more particularly to time series data organization, search, and retrieval.Time series data are sequences of time stamped records occurring in one or ...

Подробнее
Номер записи: 75
02-06-2022 дата публикации

COMMUNICATIONS DEVICE, METHOD AND COMMUNICATIONS SYSTEM FOR MANAGING A PLURALITY OF DATA STRUCTURES

Номер: US20220171757A1
Автор: MADAAN Yogesh, TEO Yongkai
Принадлежит:

A communications device for managing a plurality of data structures, which is configured to observe a data stream for changes, the data stream having a plurality of data structures, each having an associated timestamp and data corresponding to a request relating to a job, filter, sequentially based on the associated timestamps, the data structures associated with requests causing the changes, wherein, for filtering, the communications device is configured, for each data structure, to query a database, if data corresponding to the job is in the database, determine, from the data corresponding to the job, a status of the job, and determine, based on the status and the data of the data structure, whether the data of the data structure is valid data, and if there is no data corresponding to the job in the database, determine the data of the data structure as valid data, and process the valid data. 1. A communications device for managing a plurality of data structures , comprising a processor and a memory , the communications device being configured , under control of the processor , to execute instructions in the memory to:observe a data stream transmitted from a communications server apparatus for changes in a state of the data stream, the data stream comprising a plurality of data structures, wherein each data structure has an associated timestamp and data corresponding to a request relating to a job transmitted to the communications server apparatus;filter, sequentially based on the associated timestamps, the data structures associated with requests causing the changes that are observed, query a database for data corresponding to the job associated with the request corresponding to the data structure;', determine, from the data corresponding to the job, a status of the job; and', 'determine, based on the status and the data of the data structure, whether the data of the data structure is valid data; and, 'if data corresponding to the job is comprised in the database ...

Подробнее
Номер записи: 76
02-06-2022 дата публикации

VERSION CONTROL AND EXECUTION ON A MOBILE DEVICE

Номер: US20220171778A1
Автор: Desai Sachin
Принадлежит:

Disclosed are some implementations of systems, apparatus, methods and computer program products for facilitating version control for a client device. A server system may select one of two or more versions of a procedure based, at least in part, on a user profile. The server system may generate a message including a procedure name of the procedure, a version identifier identifying the selected version of the procedure, a set of computer-readable instructions corresponding to the selected version of the procedure, and a client directive pertaining to storing the procedure in a database. The server system may transmit the message to a client device associated with the user. 1. A system comprising:a database system implemented using a server system, the database system configurable to cause:accessing a user profile of a user of the database system;selecting one of two or more versions of a procedure based, at least in part, on the user profile;generating a message including a set of computer-readable instructions corresponding to the selected version of the procedure, a procedure name of the procedure, a version identifier identifying the selected version of the procedure, and a client directive pertaining to storing the procedure in a database; andtransmitting the message to a client device associated with the user.2. The system as recited in claim 1 , the client directive instructing the client device to store the computer-readable instructions in the database in association with the procedure name and version identifier.3. The system as recited in claim 1 , the client directive indicating a particular version of the procedure to be used by the client device.4. The system as recited in claim 1 , the database system configurable to cause:transmitting a second client directive to the client device, the second client directive indicating a particular version of the procedure to be used by the client device.5. The system as recited in claim 4 , the particular version ...

Подробнее
Номер записи: 77
23-04-2015 дата публикации

Mechanism for communication in a distributed database

Номер: US20150112955A1
Автор: Amitabha Biswas, Harshad S. Padhye, Nirapada Ghosh, Sushma Anantharam
Принадлежит: International Business Machines Corp

In a method for providing communication integrity within a distributed database computer system, a first node of a plurality of nodes transmits a change notification to a second node of the plurality of nodes. The second node is a neighbor of the first node. The first node receives at least one change confirmation from the second node. The change confirmation confirms acknowledgment of the change notification by the second node and by a third node of the plurality of nodes. The third node is not a neighbor of the first node. Responsive to receiving the at least one change confirmation, the first node determines that all the plurality of nodes have acknowledged the change notification.

Подробнее
Номер записи: 78
02-06-2022 дата публикации

Method of verifying that a wager was placed before market close

Номер: US20220172573A1
Автор: Casey Alexander HUKE, John Cronin, Joseph W. Beyers, Michael D'Andrea
Принадлежит: AdrenalineIP

The present disclosure provides a method to determine if a user had placed a wager and verify that the wager was placed before the wagering market closed in a play-by-play wagering network. This method provides the ability to receive a wager from a user and allows the wagering network to receive a timestamp from the user's device to determine if the wager was placed before the market closing. Also, this method provides the ability to verify that there is no fraud, malicious activity, or cheating from the user by verifying that through a 3rd party network, such as the user's network connecting the user to the internet, that the timestamps provided by the network are correct and allowing the user to confirm their wager if received a few moments after the market has closed.

Подробнее
Номер записи: 79
02-04-2020 дата публикации

REPLICATION USING DEDUPLICATED SECONDARY COPY DATA

Номер: US20200104052A1
Автор: JOB Joe Sabu Thyvelikkakakth, Vijayan Manoj Kumar
Принадлежит:

An information management system according to certain aspects uses backup copies or other secondary copies of production data for the purposes of replicating production data to another client. The secondary copies can be deduplicated copies. By utilizing available secondary copies of the data for replication, the system can reduce the impact on the production machines associated with replication. Utilizing deduplicated copies not only reduces the amount of stored data, but also reduces the amount of data that is communicated between the source and the destination, increasing the speed of the replication process. 1. (canceled)2. A system for replicating primary data from a source system to a destination system using secondary copy data in secondary storage , the system comprising:one or more source storage controller computers comprising hardware, the one or more source storage controller computers configured to send command messages in one or more secondary data replication streams to one or more destination storage controller computers, the command messages associated with a plurality of deduplicated data blocks, each command message having a timestamp associated therewith; and restore a destination deduplicated secondary copy from one or more deduplicated secondary copies stored in a backup format to one or more destination primary storage devices to create a restored version of the destination deduplicated secondary copy, the restored version is in a native format of source primary data; and', 'apply the command messages received in the one or more secondary data replication streams to the restored version of the destination deduplicated secondary copy based on timestamps associated with the command messages to create replicated destination primary data consistent with source primary data based on the timestamps, the replicated destination primary data stored in one or more destination primary storage devices in a native format of the source primary data., 'one ...

Подробнее
Номер записи: 80
11-04-2019 дата публикации

TIME-BASED CHECKPOINT TARGET FOR DATABASE MEDIA RECOVERY

Номер: US20190108107A1
Автор: Girkar Mahesh Baburao, LEE Jonghyun, Li Yunrui, Srivastava Amrish
Принадлежит:

A method, apparatus, and system for a time-based checkpoint target is provided for standby databases. Change records received from a primary database are applied for a standby database, creating dirty buffer queues. As the change records are applied, a mapping is maintained, which maps timestamps to logical times of change records that were most recently applied at the timestamp for the standby database. On a periodic dirty buffer queue processing interval, the mapping is used to determine a target logical time that is mapped to a target timestamp that is prior to a present timestamp by at least a checkpoint delay. The dirty buffer queues are then processed up to the target logical time, creating an incremental checkpoint. On a periodic header update interval, file headers reflecting a consistent logical time for the checkpoint are also updated. The intervals and the checkpoint delay are adjustable by user or application. 1. A method comprising:applying, into buffers of a standby database, a plurality of change records received from a primary database, wherein each buffer has a respective time of a change record that was latest, of the change records in the buffer, to be applied to a primary database;creating a checkpoint for one or more database files of the standby database by flushing a subset of the buffers that have a respective time that is before a present time by at least a checkpoint delay;wherein the method is performed by one or more computing devices.2. The method of wherein:flushing the subset of the buffers comprises writing data into at least one checkpoint file that contains a file header that contains a logical time;the subset of the buffers comprises a last buffer that has a latest respective time of the subset of the buffers;the method further comprises, after an update interval elapses, replacing the logical time in the file header with the respective time of the last buffer.3. The method of wherein:writing data into at least one checkpoint file ...

Подробнее
Номер записи: 81
02-04-2020 дата публикации

Concurrent authoring in semantic layer universes

Номер: US20200104283A1
Автор: Christophe Ricard, Naeem Asghar
Принадлежит: SAP SE

A system and method including authoring a semantic layer universe and at least one semantic layer set container created on top of the objects of the semantic layer universe and concurrently authoring of resources to the universe by one or more users based on a merge strategy based on at least a status of the resource being authored relative to the published universe.

Подробнее
Номер записи: 82
02-04-2020 дата публикации

SHARING CLASSIFIED OBJECTS PERCEIVED BY AUTONOMOUS VEHICLES

Номер: US20200104289A1
Автор: Premawardena Abhaya
Принадлежит:

Embodiments are disclosed for sharing classified objects perceived by autonomous vehicles. In an embodiment, a method comprises: obtaining, from an autonomous vehicle (AV), a first scene description, the first scene description including one or more classified objects detected in a first zone of a geographic area; updating, by a first edge node in the first zone and using a plurality of scene descriptions, an autonomous system grid (ASG) for the first zone; and sending, by the first edge node, the updated ASG to a second edge node located in the first zone or in a second zone of the geographic area. 1. A method comprising:obtaining, from an autonomous vehicle (AV), a first scene description, the first scene description including one or more classified objects detected in a first zone of a geographic area;updating, by a first edge node in the first zone and using a plurality of scene descriptions, an autonomous system grid (ASG) for the first zone; andsending, by the first edge node, the updated ASG to a second edge node located in the first zone or a second zone of the geographic area,wherein the method is performed by one or more special-purpose computing devices.2. The method of claim 1 , further comprising:detecting, by the first edge node, one or more outlier scene descriptions in the plurality of scene descriptions; andexcluding the one or more outlier scene descriptions from the updating.3. The method of claim 1 , further comprising:determining, by the first edge node, whether a timestamp of the first scene description exceeds an age threshold; and 'excluding the first scene description from the updating.', 'in accordance with the timestamp exceeding the age threshold,'}4. The method of claim 3 , wherein the timestamp of the first scene description is an oldest object timestamp for an object in the first scene description.5. The method of claim 1 , further comprising:generating, by the first edge node, a second scene description generated from data provided by ...

Подробнее
Номер записи: 83
11-04-2019 дата публикации

DISTRIBUTED TRANSACTION MANAGEMENT

Номер: US20190108162A1
Автор: Diaconu Cristian, Larson Per-Ake, Zwilling Michael James
Принадлежит:

The subject disclosure relates to a distributed transaction management technique that ensures synchronization between participating nodes in a global or distributed database transaction. The technique leverages a commit protocol that uses local clocks at the respective participating nodes. Participants in a global transaction are configured to utilize the same commit timestamp and logical read time and can advance their respective local clocks to establish this synchronization. In one embodiment, distributed commit utilizes a modified version of two-phase commit that includes an extra phase to collect commit timestamp votes from participants. Additionally, a heartbeat mechanism can be used to establish loose synchronization between nodes. In another embodiment, a node can respond to a remote transaction request by returning a list of nodes involved in generating the result of the transaction and the types of access used by such nodes in addition to the transaction result itself. 1. A system that processes a transaction on behalf of a node set , the system comprising:a processing unit; and initiate a transaction involving data locally stored by a plurality of nodes of the node set,', 'send a transaction request to respective participating nodes of the node set to participate in the transaction,', 'receive, from the respective participating nodes, a commit time vote for the transaction according to a local clock maintained by the participating node,', 'based on the commit time votes of the respective participating nodes, determine a commit time for the transaction having a maximum count of votes among the plurality of participating nodes, and', 'initiate commit processing of the transaction by sending a commit request to the participating nodes of the node set, wherein the commit request includes the commit time for the transaction, wherein the commit request enables the respective participating nodes that did not vote for the commit time determined for the ...

Подробнее
Номер записи: 84
28-04-2016 дата публикации

Distributed sql query processing using key-value storage system

Номер: US20160117363A1
Автор: Joshua Leners, Marcos K. Aguilera, Michael Walfish
Принадлежит: Microsoft Technology Licensing LLC

Distributed storage systems support SQL while also providing scalability and fault tolerance by utilizing an SQL library (the SQL execution component) layered on top of a transactional key-value system (the storage component). The SQL library comprises a parser and an execution engine running at the client, while the storage component comprises a key-value system for storing the data. The SQL library parses SQL queries received from client applications and maps them to transactions on the key-value system. The key-value system stores data items identified by key and provides concurrency control mechanisms to handle concurrent transactions. The key-value system may be a distributed system with several storage servers, each attached to one or more storage devices.

Подробнее
Номер записи: 85
30-04-2015 дата публикации

Detecting renaming operations

Номер: US20150120686A1
Автор: Bjoern Mielenhausen
Принадлежит: Individual

Disclosed herein are system, method, and computer program product embodiments for transforming data from a first version, for example an initial version of a database, to a second version, for example a subsequent version of a database. An embodiment includes modifying the metadata of the data to include transformational clauses, each of which describes how a portion of the data in the first version is transformed to data in the second version. Another exemplary embodiment includes differentiating between rename and add/delete operations to reduce the amount of transformational clauses included in the metadata. For example, rename operations can be identified by ignoring commonly-named columns between two versions, and identifying columns where the name has changed between the two versions while the data type has not changed.

Подробнее
Номер записи: 86
09-06-2022 дата публикации

REMEDIATION OF DATA QUALITY ISSUES IN COMPUTER DATABASES

Номер: US20220179835A1
Автор: Gummadi Krishna Sumanth, Kumar Nitik, Kumar Raj, Mohite Girish B., Molakantalla Amaranatha Reddy
Принадлежит:

A computer remediates data quality issues in a consolidated data record includes elements from several datasets, comprising. The computer determines, based at least in part on dataset feed information, dataset flow quality value for first and second datasets for a consolidated data record resulting from combining a plurality of datasets. The datasets include associated metadata. The computer, responsive to flow quality value determinations, compares dataset flow quality values with a predetermined dataset flow quality threshold and conducts a correction action for datasets with dataset flow quality value beyond the threshold. The computer determines, based at least in part on said dataset element health information, dataset health quality values for the datasets. The computer, compares the health quality values with a predetermined dataset health quality threshold and conducts a dataset health quality correction action for datasets having a dataset health quality value beyond the dataset health quality threshold. 1. A computer-implemented method to remediate data quality issues in a consolidated data record that includes elements from a plurality of datasets , comprising:determining, by said computer, based at least in part on dataset feed information, a first dataset flow quality value for a first dataset and a second dataset flow quality value for a second dataset for a consolidated data record resulting from combining a plurality of datasets, each of the first and the second datasets including respective sets of metadata associated therewith;responsive to said dataset flow quality value determinations, comparing, by said computer, said dataset flow quality values with a predetermined dataset flow quality threshold and, in response, conducting, by said computer, a consolidated data record dataset flow quality correction action for datasets having a dataset flow quality value beyond said dataset flow quality threshold;determining, by said computer, based at least ...

Подробнее
Номер записи: 87
09-04-2020 дата публикации

Scalable cloud-based time series analysis

Номер: US20200110602A1
Автор: David Bruce Elsheimer, Edward Tilden Blair, Javier DELGADO, Jennifer Leigh Sloan Beeman, Michael James Leonard, Thiago Santos Quirino
Принадлежит: SAS Institute Inc

In some examples, computing devices can partition timestamped data into groups. The computing devices can then distribute the timestamped data based on the groups. The computing devices can also obtain copies of a script configured to process the timestamped data, such that each computing device receives a copy of the script. The computing devices can determine one or more code segments associated with the groups based on content of the script. The one or more code segments can be in one or more programming languages that are different than a programming language of the script. The computing devices can then run the copies of the script to process the timestamped data within the groups. This may involve interacting with one or more job servers configured to run the one or more code segments associated with the groups.

Подробнее
Номер записи: 88
09-04-2020 дата публикации

Method and system for routing and executing transactions

Номер: US20200110632A1
Автор: Denis Nikolaevich PODLUZHNY
Принадлежит: YANDEX EUROPE AG

A distributed software system and a method for routing transactions for execution are disclosed. The distributed software system has a database sub-system partitioned into shards and a transaction routing sub-system for ordering transactions. The transaction routing sub-system has a plurality of coordinator ports and a plurality of mediator ports. The coordinator ports receive transactions to be executed by the shards and generate local per-shard orders for the received transactions. The local per-shard orders are received by the plurality of mediator ports which are pre-assigned with respective shards. The mediator ports generate centralized per-shard orders of execution based on the received per-shard orders. A given centralized per-shard order of execution is an order of execution of transactions received by a given mediator port and that are destined to be executed by a given shard that is pre-assigned to the given mediator port.

Подробнее
Номер записи: 89
13-05-2021 дата публикации

METHOD AND SYSTEM FOR IDENTIFYING ISSUES AND CONFLICTS WITH BUILDING CONSTRUCTION

Номер: US20210141805A1
Автор: Jalla Maharaj
Принадлежит:

The present invention is a computer-implemented method comprising; receiving, by a computing device, a model, wherein the mode is comprised of a plurality of members, analyzing, by the computing device, each of the plurality of members and determining if any of the plurality of members have internal conflicts and external conflicts, identifying, by the computing device, each of the members which have an internal conflict and the members which have external conflicts, and generating, by the computing device, a sick of all members with conflicts. 1. A computer-implemented method comprising: 'analyzing, by the one or more processors, each of the plurality of members for internal conflicts;', 'receiving, by one or more processors, a model, the model is comprised of a plurality of assemblies, and the assemblies are comprised of a plurality of members;'}analyzing, by the one or more processors, each of the plurality of members for member-to-member conflicts;analyzing, by the one or more processors, each of the plurality of assemblies for assembly-to-assembly conflicts, wherein an assembly-to-assembly conflict would involve at least one member of each of the assemblies involved in the conflict;analyzing, by the one or more processors, the members of the assemblies involved in the assembly-to-assembly conflicts;identifying, by the one or more processors, each of the members involved in the at least one conflict, wherein each the members involved in the at least one conflict are marked in the model;generating, by the one or more processors, a list of all the members involved in conflicts;manipulating, by the one or more processors, the members involved in the at least one conflicts, wherein the manipulation of the at least one member provides a resolution to each of the conflict; andprocessing, by the one or more processors, the model to determine if any conflicts remain.2. (canceled)3. (canceled)4. The computer-implemented method of claim 1 , further comprising claim 1 , ...

Подробнее
Номер записи: 90
13-05-2021 дата публикации

METHOD AND SYSTEM FOR IDENTIFYING CONFLICTS BETWEEN A BUILDING FRAME STRUCTURE AND FINISHING MATERIALS

Номер: US20210141807A1
Автор: Jalla Maharaj
Принадлежит:

The present invention is a computer implemented method for determining and conforming the position of finishing materials within a building, comprising: accessing, by at least one processor, a model; identifying, by at least one processor, sheathing materials and frame members; detecting, by at least one processor, at least one instance where the sheathing material interfaces with at least one of the frame members; calculating, by at least one processor, an actual location of the sheathing material relative to the frame members; comparing, by at least one processor, the actual location of the sheathing material relative to the frame members to a required location; and generating, by at least one processor, a list of interfaces which the actual location is outside the predetermined range of the required locations. 1. A computer implemented method for determining and conforming the position of finishing materials within a building , comprising:accessing, by at least one processor, a model, wherein the model is comprised of sheathing material and frame members;identifying, by at least one processor, a set of data associated with the sheathing materials and a set of data associated with the frame members;detecting, by at least one processor, at least one instance where the sheathing material interfaces with at least one of the frame members;calculating, by at least one processor, an actual location of the sheathing material relative to the frame members;comparing, by at least one processor, the actual location of the sheathing material relative to the frame members to a required location;generating, by at least one processor, a list of interfaces which the actual location is outside the predetermined range of the required locations; andmanipulating, by at least one processors, the set of data associated with the sheathing material and the set of data associated with the frame members based on the generated list of interfaces.2. The computer implemented method of claim 1 ...

Подробнее
Номер записи: 91
13-05-2021 дата публикации

METHOD AND SYSTEM FOR IDENTIFYING CONFLICTS BETWEEN A BUILDING'S FRAME STRUCTURE AND FURNITURE

Номер: US20210141808A1
Автор: Jalla Maharaj
Принадлежит:

The present invention is a computer implemented method for determining and conforming the position of furniture within a building, comprising: accessing, by at least one processor, a model; identifying, by at least one processor, components and frame members, wherein the components are positioned within the model and interface with select frame members; detecting, by at least one processor, at least one instance where the component interfaces with at least one of the frame members; calculating, by at least one processor, an actual location of the component relative to the frame members; comparing, by at least one processor, the actual location of the component relative to the frame members to a required location; and generating, by at least one processor, a list of interfaces which the actual location is outside the predetermined range of the required locations. 1. A computer implemented method for determining and conforming the position of furniture within a building , comprising:accessing, by at least one processor, a model, wherein the model is comprised of frame members;identifying, by at least one processor, components and frame members, wherein the components are positioned within the model and interface with frame members, wherein the components interface with a set of frame members associated with a floor and a set of frame members associated with a wall;analyzing, by at least one processor, at least one instance where the component interfaces with at least one of the frame members;calculating, by at least one processor, an actual location of the component relative to the frame members;comparing, by at least one processor, the actual location of the component relative to the frame members to a required location;generating, by at least one processor, a list of interfaces which the actual location is outside the predetermined range of the required locations; andmanipulating, by at least one processors, the actual location of the component relative to the frame ...

Подробнее
Номер записи: 92
13-05-2021 дата публикации

METHOD AND SYSTEM FOR IDENTIFYING CONFLICTS BETWEEN BUILDING FRAME STRUCTURE AND FIXTURES

Номер: US20210141809A1
Автор: Jalla Maharaj
Принадлежит:

The present invention is a computer implemented method for determining and conforming the position of fixture within a building, comprising: accessing, by at least one processor, a model; identifying, by at least one processor, a fixture and frame members, wherein the fixture are positioned within the model and interface with select frame members and have a set of properties; detecting, by at least one processor, at least one instance where the fixture interfaces with at least one of the frame members; calculating, by at least one processor, an actual location of the fixture relative to the frame members; comparing, by at least one processor, the actual location of the fixture relative to the frame members to a required location, wherein the required location is based on the set of properties and determining if the actual location is within a tolerance of the required location; and generating, by at least one processor, a list of interfaces which the actual location is outside the predetermined range of the required locations. 1. A computer implemented method for determining and conforming the position of fixture within a building , comprising:accessing, by at least one processor, a model, wherein the model is comprised of a set of frame members;populating, by at least one processors, a set of fixtures within the model;identifying, by at least one processor, a fixture and frame members, wherein the fixture is positioned within the model and interfaces with select frame members;marking, by at least one processor, where the fixture interfaces with at least one of the frame members;calculating, by at least one processor, an actual location of the fixture relative to the frame members within the model;comparing, by at least one processor, the actual location of the fixture relative to the frame members to a required location, wherein the required location is based on the set of properties and determining if the actual location is within a tolerance of the required ...

Подробнее
Номер записи: 93
13-05-2021 дата публикации

Method and system for identifying conflicts between building frame structure and mechanical systems

Номер: US20210141810A1
Автор: Maharaj Jalla
Принадлежит: Consulting Engineers Corp

The present invention is a computer implemented method comprising: accessing, by at least one processor, a model of a building, wherein the model is comprised of a plurality of members; incorporating, by at least one processor, a mechanical system within the building model; identifying, by at least one processor, at least one instance where the mechanical system interfaces with at least one member; analyzing, by at least one processor, the interface between the mechanical system and the at least one member, wherein a set of actual values are calculated; comparing, by at least one processor, the actual values to required values based on the type of interface, and determining if the actual values is within a predetermined range of the required values, and generating, by at least one processor, a list of interfaces which the actual value it outside the predetermined range of the actual values.

Подробнее
Номер записи: 94
13-05-2021 дата публикации

METHOD AND SYSTEM FOR IDENTIFYING CONFLICTS BETWEEN BUILDING FRAME STRUCTURE AND ELECTRICAL SYSTEMS

Номер: US20210141811A1
Автор: Jalla Maharaj
Принадлежит:

The present invention is a computer implemented method for determining and conforming the position of electrical systems within a building, comprising: analyzing a model, wherein the model is comprised of a plurality of members; identifying an electrical system, wherein the electrical system is integrated into the model; identifying where the electrical system interfaces with the plurality of members; isolating the group of members which interface with the electrical system; calculating a set of actual values associated with the interfaces between the electrical system and the group of members; comparing the actual values to a required value, and determining if the actual value is within a predetermined range of the required value; and generating a list of interfaces which the actual value it outside the predetermined range of the actual values. 1. A computer implemented method for determining and conforming the position of electrical systems within a building , comprising:analyzing, by at least one processor, a model, wherein the model is comprised of a plurality of members;manipulating, by at least one processor, the model by incorporating an electrical system, wherein the electrical system is integrated into the model;identifying, by at least one processor, where the electrical system interfaces with the plurality of members;modifying, by at least one processors, the members that interface with the electrical system, wherein the modification is related to visual data associated with the members;isolating, by one or more processor, the group of members which interface with the electrical system;comparing, by at least one processor, a set of actual values associated with the interfaces between the electrical system and the group of members and a set of required values related to the interfaces;generating, by at least one processor, a visual indicator of the interfaces which the actual value it outside the predetermined range of the actual values, wherein the visual ...

Подробнее
Номер записи: 95
13-05-2021 дата публикации

METHOD AND SYSTEM FOR IDENTIFYING CONFLICTS BETWEEN BUILDING FRAME STRUCTURE AND PLUMBING SYSTEMS

Номер: US20210141812A1
Автор: Jalla Maharaj
Принадлежит:

The present invention is a computer implemented method for determining and conforming the position of plumbing systems within a building, comprising: analyzing a model, wherein the model is comprised of a plurality of members; identifying an plumbing system, wherein the plumbing system is integrated into the model and is comprised of a series of components; identifying where the plumbing system interfaces with the plurality of members; isolating, by one or more processor, the group of members which interface with the plumbing system; calculating, by one or more processor, a set of actual values associated with the interfaces between the plumbing system and the group of members; comparing the actual values to a required value, and determining if the actual value is within a predetermined range of the required value; and generating a list of interfaces which the actual value it outside the predetermined range of the actual values. 1. A computer implemented method for determining and conforming the position of plumbing systems within a building , comprising:analyzing, by at least one processor, a model, wherein the model is comprised of a plurality of members;implementing, by at least one processor, a plumbing system, wherein the plumbing system is based on a model design;identifying, by at least one processor, where the plumbing system interfaces with the plurality of members, wherein the interfaces have specific data sets;isolating, by one or more processor, the group of members which interface with the plumbing system;comparing, by at least one processor, the interface specific data sets, and determining if the data set is within a predetermined range of values; andgenerating, by at least one processor, a list of interfaces which the specific data set is outside the predetermined range of the specific data set, wherein the list of interfaces provides a plurality of manipulations to the plumbing system.2. The computer implemented method of claim 1 , wherein the type ...

Подробнее
Номер записи: 96
13-05-2021 дата публикации

Document-based Distributed Inventory System With Rebalancing

Номер: US20210142263A1
Автор: Kalter William Jacob, Siddiqui Fahd Murtuza, Thakkar Rishabh Saumil
Принадлежит: Adobe Inc.

A distributed inventory system is made up of multiple regions, each of which includes a document-based database and an inventory management system. The document-based database maintains documents regarding inventory counts for different items of inventory. The inventory management system updates the inventory counts in the documents in its database in response to client requests (e.g., due to an item being ordered or returned by a customer) and in response to replication data received from other regions indicating changes to the inventory counts in the documents maintained in document-based databases in those other regions. Each region is assigned a particular inventory count for an item and can, in response to the inventory count in a region getting too low, rebalance the inventory count distribution by transferring inventory count from one region to another. 1. In a digital medium environment to provide a distributed inventory system , a method implemented by at least one computing device , the method comprising:maintaining, as part of the distributed inventory system, a document-based database of a first region;receiving, from a client, a request to update an inventory count for an item by a first amount;checking a first version of a document in the document-based database indicating a current inventory count for the item assigned to the first region to determine whether performing the request would result in the current inventory count for the item falling below zero;returning to the client, in response to determining that performing the request would result in the current inventory count for the item falling below zero, an indication of failure of the request without updating the current inventory count for the item by the first amount;determining that the inventory count has fallen below a threshold amount;communicating, in response to determining that the inventory count has fallen below the threshold amount, a first rebalance request to a second region of ...

Подробнее
Номер записи: 97
09-04-2020 дата публикации

TECHNOLOGIES FOR MANAGING COMPROMISED SENSORS IN VIRTUALIZED ENVIRONMENTS

Номер: US20200112493A1
Автор: Chang Shih-Chun, Gandham Shashidhar, Gupta Anubhav, Pang Jackson Ngoc Ki, Singh Abhishek Ranjan, Vu Hai Trong, Yadav Navindra
Принадлежит:

Systems, methods, and computer-readable media for managing compromised sensors in multi-tiered virtualized environments. In some embodiments, a system can receive, from a first capturing agent deployed in a virtualization layer of a first device, data reports generated based on traffic captured by the first capturing agent. The system can also receive, from a second capturing agent deployed in a hardware layer of a second device, data reports generated based on traffic captured by the second capturing agent. Based on the data reports, the system can determine characteristics of the traffic captured by the first capturing agent and the second capturing agent. The system can then compare the characteristics to determine a multi-layer difference in traffic characteristics. Based on the multi-layer difference in traffic characteristics, the system can determine that the first capturing agent or the second capturing agent is in a faulty state. 1. A method comprising:receiving, from a plurality of capturing agents deployed in a plurality of devices, data generated based on traffic at the plurality of devices;comparing characteristics of the data to determine a difference in the characteristics; andbased on the difference, determining a state of at least one of the plurality of capturing agents, 'the data is generated based on observed data, statistics, and/or metadata about one or more packets, flows, communications, processes, events, and/or activities at the plurality of devices.', 'wherein,'}2. The method of claim 1 , the data is captured at a virtualization layer,', 'the virtualization layer includes a virtual machine or a hypervisor,', 'a first one of the plurality of devices includes a leaf switch in a spine-leaf network fabric, and', 'a second one of the plurality of devices includes a host of the hypervisor coupled with the spine-leaf network fabric via the leaf switch., 'wherein,'}3. The method of claim 2 , the state includes unauthorized activity, and', 'the ...

Подробнее
Номер записи: 98
09-04-2020 дата публикации

SERVER-CLIENT DETERMINATION

Номер: US20200112494A1
Автор: Alizadeh Attar Mohammadreza, Jeyakumar Vimalkumar, Madani Omid, Parandehgheibi Ali, Scheib Ellen Christine, Singh Abhishek Ranjan, Yadav Navindra
Принадлежит:

Systems, methods, and computer-readable media are provided for determining whether a node in a network is a server or a client. In some examples, a system can collect, from one or more sensors that monitor at least part of data traffic being transmitted via a pair of nodes in a network, information of the data traffic. The system can analyze attributes of the data traffic such as timing, port magnitude, degree of communication, historical data, etc. Based on analysis results and a predetermined rule associated with the attributes, the system can determine which node of the pair of nodes is a client and which node is a server. 1. A method comprising: determining, based on the information, that the first node is a client and that the second node is a server; and', 'creating one or more classifiers of servers and clients in the network from the result of the determining., 'receiving, from a sensor that monitors at least part of data traffic exchanged between a pair of nodes in a network, information of the data traffic, the pair of nodes comprising a first node and a second node;'}2. The method of claim 1 , wherein the determining is further based on one or more rules associated with timing claim 1 , port magnitude claim 1 , degree of communication claim 1 , or historical data obtained from the information.3. The method of claim 1 , further comprising:associating a weight with the sensor, the weight based on one or more of accuracy, margin of error, length of time of observation, or amount of information collected by the sensor, wherein the information of the data traffic reported by the sensor is weighted using the weight.4. The method of claim 1 , further comprising:generating at least a first communication graph for the network, the first communication graph comprising the first node, the second node, and one or more other nodes; andbased on the classifiers of servers and clients in the network, assigning classifiers of servers or clients to the one or more other ...

Подробнее
Номер записи: 99
13-05-2021 дата публикации

Policy utilization analysis

Номер: US20210144073A1
Автор: Ali Parandehgheibi, Ashutosh Kulshreshtha, Khawar Deen, Michael Standish Watts, Navindra Yadav, Shashidhar Gandham, Sunil Kumar Gupta
Принадлежит: Cisco Technology Inc

An example method according to some embodiments includes receiving flow data for a packet traversing a network. The method continues by determining a source endpoint group and a destination endpoint group for the packet. The method continues by determining that a policy was utilized, the policy being applicable to the endpoint group. Finally, the method includes updating utilization data for the policy based on the flow data.

Подробнее
Номер записи: 100