Patents by Inventor Dmitri Perelman
Dmitri Perelman has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20230104717Abstract: The present disclosure relates to systems, methods, and non-transitory computer readable storage media for implementing a scalable, secure, efficient, and adaptable distributed digital ledger transaction network. Indeed, the disclosed systems can reduce storage and processing requirements, improve security of implementing computing devices and underlying digital assets, accommodate a wide variety of different digital programs (or “smart contracts”), and scale to accommodate billions of users and associated digital transactions. For example, the disclosed systems can utilize a host of features that improve storage, account/address management, digital transaction execution, consensus, and synchronization processes. The disclosed systems can also utilize a new programming language that improves efficiency and security of the distributed digital ledger transaction network.Type: ApplicationFiled: November 21, 2022Publication date: April 6, 2023Inventors: Avery Li Kuang Ching, François Garillot, Mathieu J.P. Baudet, Georges Danezis, Zekun Li, Dmitri Perelman, Benjamin D. Maurer
-
Patent number: 11621891Abstract: A disclosed computer-implemented method may include partitioning, based on a social graph representative of social connections among a plurality of users of a social networking system, the plurality of users into a plurality of user buckets. Each user bucket may include at least one user of the social networking system. The method may further include selecting a set of user buckets from the plurality of user buckets, assigning the set of user buckets to a data center included in a networking infrastructure, and routing data sent from a user device associated with a user included in the set of user buckets to the data center. Various other methods, systems, and computer-readable media are also disclosed.Type: GrantFiled: April 15, 2020Date of Patent: April 4, 2023Assignee: Meta Platforms, Inc.Inventors: David Shu-Hao Chou, Tianyin Xu, Kaushik Veeraraghavan, Andrew John Newell, Sonia Margulis, Lin Xiao, Pol Mauri Ruiz, Justin James Meza, Kiryong Ha, Shruti Padmanabha, Kevin Burton Cole, Dmitri Perelman
-
Publication number: 20230089095Abstract: The present disclosure relates to systems, methods, and non-transitory computer readable storage media for implementing a scalable, secure, efficient, and adaptable distributed digital ledger transaction network. Indeed, the disclosed systems can reduce storage and processing requirements, improve security of implementing computing devices and underlying digital assets, accommodate a wide variety of different digital programs (or “smart contracts”), and scale to accommodate billions of users and associated digital transactions. For example, the disclosed systems can utilize a host of features that improve storage, account/address management, digital transaction execution, consensus, and synchronization processes. The disclosed systems can also utilize a new programming language that improves efficiency and security of the distributed digital ledger transaction network.Type: ApplicationFiled: November 21, 2022Publication date: March 23, 2023Inventors: Avery Li Kuang Ching, François Garillot, Mathieu J.P. Baudet, Georges Danezis, Zekun Li, Dmitri Perelman, Benjamin D. Maurer
-
Patent number: 10931743Abstract: A disclosed computer-implemented method may include receiving, via a monitoring infrastructure that monitors an operational state of a networking infrastructure, data representative of the operational state of the networking infrastructure during a period of time. The networking infrastructure may include (1) a plurality of data centers, and (2) at least one point-of-presence (POP) edge node. The method may also include (1) accessing data representative of a set of predefined policies associated with the networking infrastructure, and (2) based on the data representative of the operational state (a) determining a set of edge load factors associated with the edge node, and (b) generating, via a linear solver and further based the set of edge load factors associated with the edge node and the set of predefined policies associated with the networking infrastructure, a routing table for the POP edge node. Various other methods, systems, and computer-readable media are also disclosed.Type: GrantFiled: March 2, 2020Date of Patent: February 23, 2021Assignee: Facebook, Inc.Inventors: David Shu-Hao Chou, Tianyin Xu, Kaushik Veeraraghavan, Andrew John Newell, Sonia Margulis, Lin Xiao, Pol Mauri Ruiz, Justin James Meza, Kiryong Ha, Shruti Padmanabha, Kevin Burton Cole, Dmitri Perelman
-
Patent number: 10503720Abstract: A multi-shard database system receives a transaction including multiple actions directed to different shards of the database system. The database system creates a transaction record including a transaction identifier and a transaction status for the transaction in a transaction database. The database system then executes, in parallel, the multiple actions on the different shards by associating with each data item involved in the transaction a data structure that includes the transaction identifier and new data to be applied to the data item. The database system then updates the transaction status in the transaction record for the transaction from pending to completed when each of the multiple actions is successfully executed on the corresponding shard. Consistency is eventually implemented when the data structures associated with the data items involved in the transaction are evaluated. The evaluation of a data structure can be triggered by a read request or other events.Type: GrantFiled: February 16, 2017Date of Patent: December 10, 2019Assignee: Facebook, Inc.Inventors: Neil Earnest Chao, Daniel Nota Peek, Dmitri Perelman, Philippe Vincent Ajoux
-
Publication number: 20170161310Abstract: A multi-shard database system receives a transaction including multiple actions directed to different shards of the database system. The database system creates a transaction record including a transaction identifier and a transaction status for the transaction in a transaction database. The database system then executes, in parallel, the multiple actions on the different shards by associating with each data item involved in the transaction a data structure that includes the transaction identifier and new data to be applied to the data item. The database system then updates the transaction status in the transaction record for the transaction from pending to completed when each of the multiple actions is successfully executed on the corresponding shard. Consistency is eventually implemented when the data structures associated with the data items involved in the transaction are evaluated. The evaluation of a data structure can be triggered by a read request or other events.Type: ApplicationFiled: February 16, 2017Publication date: June 8, 2017Inventors: Neil Earnest Chao, Daniel Nota Peek, Dmitri Perelman, Philippe Vincent Ajoux
-
Patent number: 9613122Abstract: A multi-shard database system receives a transaction including multiple actions directed to different shards of the database system. The database system creates a transaction record including a transaction identifier and a transaction status for the transaction in a transaction database. The database system then executes, in parallel, the multiple actions on the different shards by associating with each data item involved in the transaction a data structure that includes the transaction identifier and new data to be applied to the data item. The database system then updates the transaction status in the transaction record for the transaction from pending to completed when each of the multiple actions is successfully executed on the corresponding shard. Consistency is eventually implemented when the data structures associated with the data items involved in the transaction are evaluated. The evaluation of a data structure can be triggered by a read request or other events.Type: GrantFiled: May 2, 2014Date of Patent: April 4, 2017Assignee: Facebook, Inc.Inventors: Neil Earnest Chao, Daniel Nota Peek, Dmitri Perelman, Philippe Vincent Ajoux
-
Publication number: 20150317349Abstract: A multi-shard database system receives a transaction including multiple actions directed to different shards of the database system. The database system creates a transaction record including a transaction identifier and a transaction status for the transaction in a transaction database. The database system then executes, in parallel, the multiple actions on the different shards by associating with each data item involved in the transaction a data structure that includes the transaction identifier and new data to be applied to the data item. The database system then updates the transaction status in the transaction record for the transaction from pending to completed when each of the multiple actions is successfully executed on the corresponding shard. Consistency is eventually implemented when the data structures associated with the data items involved in the transaction are evaluated. The evaluation of a data structure can be triggered by a read request or other events.Type: ApplicationFiled: May 2, 2014Publication date: November 5, 2015Applicant: FACEBOOK, INC.Inventors: Neil Earnest Chao, Daniel Nota Peek, Dmitri Perelman, Philippe Vincent Ajoux
-
Patent number: 8943178Abstract: A method for continuously updating a set of replicas. The method comprises storing a plurality of replicas of data in a current configuration of members from a plurality of nodes, receiving a reconfiguration command by a member of said current configuration, selecting at least one estimated configuration from said plurality of nodes, receiving at least one write command by a member of said current configuration, disseminating said at least one write command to each member of said at least one estimated configuration and validating said at least one estimated configuration. At least one estimated configuration processes at least one of the write commands before the validating is completed.Type: GrantFiled: August 29, 2012Date of Patent: January 27, 2015Assignee: International Business Machines CorporationInventors: Vita Bortnikov, Gregory Chockler, Dmitri Perelman, Shlomit Shachor, Ilya Shnayderman, Alexey Roytman
-
Patent number: 8676814Abstract: Face-containing images within web pages are automatically annotated to identify the people having those faces. The annotation is based on faces detected in the images and named entities detected in text associated with the images. Each candidate named entity may be scored by the prominence of the named entity in the text relative to the other extracted named entities. Queries are sent to a search engine based on the extracted candidate named entities. Sample images are returned. Face similarity calculations may be computed based on the featured faces and sample faces detected in the search engine-returned sample images to associate a probability score between each featured face and each candidate named entity. A bipartite matching instance may be solved to arrive at a maximum likelihood assignment of named entities to featured faces.Type: GrantFiled: February 16, 2012Date of Patent: March 18, 2014Assignee: Yahoo! Inc.Inventors: Dmitri Perelman, Edward Bortnikov, Ronny Lempel, Roman Sandler
-
Publication number: 20140074996Abstract: A method for continuously updating a set of replicas. The method comprises storing a plurality of replicas of data in a current configuration of members from a plurality of nodes, receiving a reconfiguration command by a member of said current configuration, selecting at least one estimated configuration from said plurality of nodes, receiving at least one write command by a member of said current configuration, disseminating said at least one write command to each member of said at least one estimated configuration and validating said at least one estimated configuration. At least one estimated configuration processes at least one of the write commands before the validating is completed.Type: ApplicationFiled: August 29, 2012Publication date: March 13, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Vita Bortnikov, Gregory Chockler, Dmitri Perelman, Shlomit Shachor, Ilya Shnayderman, Alexey Roytman
-
Publication number: 20130218858Abstract: Face-containing images within web pages are automatically annotated to identify the people having those faces. The annotation is based on faces detected in the images and named entities detected in text associated with the images. Each candidate named entity may be scored by the prominence of the named entity in the text relative to the other extracted named entities. Queries are sent to a search engine based on the extracted candidate named entities. Sample images are returned. Face similarity calculations may be computed based on the featured faces and sample faces detected in the search engine-returned sample images to associate a probability score between each featured face and each candidate named entity. A bipartite matching instance may be solved to arrive at a maximum likelihood assignment of named entities to featured faces.Type: ApplicationFiled: February 16, 2012Publication date: August 22, 2013Inventors: Dmitri Perelman, Edward Bortnikov, Ronny Lempel, Roman Sandler