Patents by Inventor Abhishek RAI
Abhishek RAI 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: 20240119045Abstract: Systems, devices, computer-implemented methods, and tangible non-transitory computer-readable media for generating reports from one or more databases that store disparate datasets are provided. Specifically, the proposed systems enable the intelligent generation of reports from multiple datasets by automatically determining a proposed set of join configurations for combination of the multiple datasets. Unique identifiers can be assigned to a portion of the combined dataset and the combined dataset can be expanded for performing an aggregation operation associated with the portion of the combined dataset by referencing the one or more unique identifiers. Reports can be generated based on the combined dataset and the aggregation operation.Type: ApplicationFiled: October 6, 2023Publication date: April 11, 2024Inventors: Nikunj Aggarwal, Utkarsh Bhatia, Kyle Michael Boston, Siddhartha Gunda, Abhishek Gupta, VenuMadhav Kattagoni, Himanshu Nanda, Ayush Rai
-
Publication number: 20230122781Abstract: Data corresponding to first and second datasets are stored within a low-latency buffer. A first query is executed by computing a join between the first and second datasets to produce a first output using the data stored in the low-latency buffer. Following execution of the first query, data corresponding to the first dataset is maintained in the low-latency buffer and data corresponding to the second dataset is purged from the low-latency buffer based on a determination that the first dataset is a static dataset and a determination that the second dataset is not a static dataset. A second query is then executed using the first dataset to produce a second output while the data corresponding to the first dataset is maintained in the low-latency buffer. The second query may be the same as or different from the first query.Type: ApplicationFiled: October 19, 2022Publication date: April 20, 2023Inventors: Satyam Shekhar, Priyendra Singh Deshwal, Abhishek Rai
-
Publication number: 20230120592Abstract: A query generation and processing system includes a relational data store, a query generator, and a query processor. The relational data store stores data ingested from data sources in a first and second datasets. The query generator interprets a data expression in a simplified query language to generate a query in a structured query language based on identifying quads corresponding to the first and second datasets in the data expression and determining an implicit join between the quads based on an unambiguous relationship obtainable from a schema of the first and datasets, in which the data expression does not expressly identify a join between the first quad and the second quad. The query processor generates a query pipeline that uses the data of the first and second datasets stored by the relational data store to execute the query generated by the query processor.Type: ApplicationFiled: October 19, 2022Publication date: April 20, 2023Inventors: Priyendra Singh Deshwal, Vijay Krishnan Ganesan, Abhishek Rai, Satyam Shekhar, Jordan Farr Hannel
-
Publication number: 20230124100Abstract: Data is ingested from one or more data sources directly into a low-latency memory buffer. In response to ingesting the data, the ingested data is accessed within the low-latency memory buffer to execute a query without requiring creation of a copy of the ingested data and thus without first writing the ingested data to a warm or cold storage. At some point subsequent to executing the query, the ingested data may be purged from the low-latency memory buffer, such as based on a recency of use of a dataset corresponding to the ingested data for query execution. The purging of the ingested data moves the ingested data to a warm or cold storage and clears space in the low-latency memory buffer for later ingested data to be accessed directly within the memory buffer for query execution also without requiring creation of a copy thereof.Type: ApplicationFiled: October 19, 2022Publication date: April 20, 2023Inventors: Abhishek Rai, Satyam Shekhar, Priyendra Singh Deshwal
-
Publication number: 20220253421Abstract: Indexing in a low-latency data access and analysis system includes accessing, by an indexing unit of a low-latency data access and analysis system, constituent data from a data source of the low-latency data access and analysis system and indexing the constituent data in an index of the low-latency data access and analysis system by an indexing unit of the low-latency data access and analysis system. Indexing includes partitioning the constituent data based on a characteristic of the constituent data into at least a first partition and a second partition, segmenting the first partition into a first segment of the first partition, sharding the first segment into a first shard of the first segment of the first partition, segmenting, using hash-partitioning, the second partition into one or more segments of the second partition, and for respective segments of the second partition, sharding the respective segment into one or more respective shards.Type: ApplicationFiled: April 18, 2022Publication date: August 11, 2022Inventors: Peter Kuimelis, Naresh Kumar, Satyam Shekhar, Amit Prakash, Abhishek Rai
-
Patent number: 11334548Abstract: Index sharding in a low-latency database analysis system includes obtaining index configuration data for indexing constituent data, the constituent data including a plurality of logical tables, and indexing, by an indexing unit, the constituent data by partitioning the constituent data based on a characteristic of the constituent data into at least a first partition and a second partition, segmenting the first partition into a first segment of the first partition, sharding the first segment into a first shard of the first segment of the first partition, segmenting, using hash-partitioning, the second partition into one or more segments of the second partition, and for each segment of the second partition, sharding the segment into one or more respective shards.Type: GrantFiled: August 30, 2019Date of Patent: May 17, 2022Assignee: ThoughtSpot, Inc.Inventors: Peter Kuimelis, Naresh Kumar, Satyam Shekhar, Amit Prakash, Abhishek Rai
-
Patent number: 11188253Abstract: In a computer system with a disk array that has physical storage devices arranged as logical storage units and is capable of carrying out hardware storage operations on a per logical storage unit basis, data movement operations can be carried out on a per-file basis. A data mover software component for use in a computer or storage system enables cloning and initialization of data to provide high data throughput without moving the data between the kernel and application levels.Type: GrantFiled: September 12, 2016Date of Patent: November 30, 2021Assignee: VMware, Inc.Inventors: Satyam B. Vaghani, Mayank Rawat, Abhishek Rai
-
Patent number: 11188254Abstract: In a computer system with a disk array that has physical storage devices arranged as logical storage units and is capable of carrying out hardware storage operations on a per logical storage unit basis, data movement operations can be carried out on a per-file basis. A data mover software component for use in a computer or storage system enables cloning and initialization of data to provide high data throughput without moving the data between the kernel and application levels.Type: GrantFiled: January 18, 2017Date of Patent: November 30, 2021Assignee: VMware, Inc.Inventors: Satyam B. Vaghani, Mayank Rawat, Abhishek Rai
-
Publication number: 20210109974Abstract: Query execution on compressed in-memory data includes receiving, at a processor of an instance of a distributed in-memory database, a query for data from a table stored in the distributed in-memory database as compressed table data, obtaining results data responsive to the query from the table, and outputting the results data for presentation to a user. Obtaining results data includes allocating memory to identify allocated memory for decompressing the compressed table data, obtaining uncompressed table data by decompressing the compressed table data into the allocated memory, and obtaining the results data from the uncompressed table data. The allocated memory is deallocated in response to obtaining the results data. Compressing a table to form compressed table data is also described.Type: ApplicationFiled: October 13, 2020Publication date: April 15, 2021Inventors: Satyam Shekhar, Prateek Gaur, Amit Prakash, Abhishek Rai
-
Patent number: 10776206Abstract: Described herein is technology for, among things, a distributed transaction system. The distributed transaction system includes a number of computing entities and a data storage unit in communication with the computing entities. The data storage unit is operable to store a file system that is accessible by the computing entities. The data storage unit is also operable to store a number of transaction journals corresponding to respective computing entities. The transaction journals describe transactions of the computing entities on the file system. A particular computing entity is operable to maintain a respective transaction journal without communicating with the other computing entities.Type: GrantFiled: February 16, 2007Date of Patent: September 15, 2020Assignee: VMware, Inc.Inventors: Satyam B. Vaghani, Yuen-Lin Tan, Abhishek Rai
-
Publication number: 20200287622Abstract: A method of synchronizing state of a Label Switched Path (LSP) of a Generalized Multiprotocol Label Switching (GMPLS) based optical communication network with that of a data plane of the network is disclosed. The method includes: receiving, at a network device, Resource ReserVation Protocol (RSVP) path objects that include at least one private object, wherein the at least one private object carries information that enables control plane of the network to synchronize at least one node downstream of the LSP; and synchronizing, using the network device, the state of the LSP with state of the data plane based on the at least one private object. The at least one private object can include one or more specific structures that enable the at least one node to uniquely identify and program equipment operatively connected with the at least one node.Type: ApplicationFiled: March 4, 2019Publication date: September 10, 2020Applicant: CENTRE FOR DEVELOPMENT OF TELEMATICSInventors: Abhishek RAI, Aditya Veer SINGH
-
Publication number: 20200250163Abstract: Index sharding in a low-latency database analysis system includes obtaining index configuration data for indexing constituent data, the constituent data including a plurality of logical tables, and indexing, by an indexing unit, the constituent data by partitioning the constituent data based on a characteristic of the constituent data into at least a first partition and a second partition, segmenting the first partition into a first segment of the first partition, sharding the first segment into a first shard of the first segment of the first partition, segmenting, using hash-partitioning, the second partition into one or more segments of the second partition, and for each segment of the second partition, sharding the segment into one or more respective shards.Type: ApplicationFiled: August 30, 2019Publication date: August 6, 2020Inventors: Peter Kuimelis, Naresh Kumar, Satyam Shekhar, Amit Prakash, Abhishek Rai
-
Publication number: 20170124112Abstract: In a computer system with a disk array that has physical storage devices arranged as logical storage units and is capable of carrying out hardware storage operations on a per logical storage unit basis, data movement operations can be carried out on a per-file basis. A data mover software component for use in a computer or storage system enables cloning and initialization of data to provide high data throughput without moving the data between the kernel and application levels.Type: ApplicationFiled: January 18, 2017Publication date: May 4, 2017Applicant: VMware, Inc.Inventors: Satyam B. Vaghani, Mayank Rawat, Abhishek Rai
-
Publication number: 20160378773Abstract: In a computer system with a disk array that has physical storage devices arranged as logical storage units and is capable of carrying out hardware storage operations on a per logical storage unit basis, data movement operations can be carried out on a per-file basis. A data mover software component for use in a computer or storage system enables cloning and initialization of data to provide high data throughput without moving the data between the kernel and application levels.Type: ApplicationFiled: September 12, 2016Publication date: December 29, 2016Applicant: VMware, Inc.Inventors: Satyam B. Vaghani, Mayank Rawat, Abhishek Rai
-
Patent number: 9454368Abstract: In a computer system with a disk array that has physical storage devices arranged as logical storage units and is capable of carrying out hardware storage operations on a per logical storage unit basis, data movement operations can be carried out on a per-file basis. A data mover software component for use in a computer or storage system enables cloning and initialization of data to provide high data throughput without moving the data between the kernel and application levels.Type: GrantFiled: January 21, 2009Date of Patent: September 27, 2016Assignee: VMware, Inc.Inventors: Satyam B. Vaghani, Mayank Rawat, Abhishek Rai
-
Patent number: 9405794Abstract: An information retrieval system converts unstructured ad-hoc search queries into structured search instructions that retrieve data in a structured relational database or an unstructured database. Data from the database is uploaded into a distributed in-memory database system. Tokens are automatically generated based on attributes, measures, and other metadata extracted from the relational database. The tokens are then compared with the non-structured ad-hoc user search queries. The information retrieval system uses the tokens to identify or predict what structured data is associated with user search queries. The tokens guide the user through a set of search terms that the system then uses to generate the structured query instructions. The structured query instructions retrieve specific data and answers from in the database system.Type: GrantFiled: July 17, 2013Date of Patent: August 2, 2016Assignee: THOUGHTSPOT, INC.Inventors: Amit Prakash, Ajeet Singh, Priyendra Singh Deshwal, Joy Dutta, Shashank Gupta, Vijay Krishnan Ganesan, Abhishek Rai, Sanjay Agrawal, Vibhor Nanavati, Stephane Antonin Kiss
-
Publication number: 20150026145Abstract: An information retrieval system converts unstructured ad-hoc search queries into structured search instructions that retrieve data in a structured relational database or an unstructured database. Data from the database is uploaded into a distributed in-memory database system. Tokens are automatically generated based on attributes, measures, and other metadata extracted from the relational database. The tokens are then compared with the non-structured ad-hoc user search queries. The information retrieval system uses the tokens to identify or predict what structured data is associated with user search queries. The tokens guide the user through a set of search terms that the system then uses to generate the structured query instructions. The structured query instructions retrieve specific data and answers from in the database system.Type: ApplicationFiled: July 17, 2013Publication date: January 22, 2015Applicant: Scaligent Inc.Inventors: Amit Prakash, Ajeet Singh, Priyendra Singh Deshwal, Joy Dutta, Shashank Gupta, Vijay Krishnan Ganesan, Abhishek Rai, Sanjay Agrawal, Vibhor Nanavati, Stephane Antonin Kiss
-
Patent number: 8560747Abstract: A method, system and program code for implementing distributed locks to be maintained through the use of on disk heartbeats. An instance of a node need only maintain a single heartbeat for all locks associated with the node and all of its processes. The node updates its heartbeat by accessing common storage, either virtual or physical, and updating a timestamp value in its heartbeat within a predetermined time interval, otherwise the heartbeat becomes stale. Expired heartbeats can be cleared or broken to allow redistribution of any locks associated therewith. The inventive technique may be implemented in a traditional computer environment or in a fully or partially virtualized environment and requires no use of an IP network or a separate network based lock manager.Type: GrantFiled: February 16, 2007Date of Patent: October 15, 2013Assignee: VMware, Inc.Inventors: Yuen-Lin Tan, Satyam Vaghani, Dragan Stancevic, Abhishek Rai, Daniel J. Scales
-
Publication number: 20100186014Abstract: In a computer system with a disk array that has physical storage devices arranged as logical storage units and is capable of carrying out hardware storage operations on a per logical storage unit basis, data movement operations can be carried out on a per-file basis. A data mover software component for use in a computer or storage system enables cloning and initialization of data to provide high data throughput without moving the data between the kernel and application levels.Type: ApplicationFiled: January 21, 2009Publication date: July 22, 2010Applicant: VMWARE, INC.Inventors: Satyam B. VAGHANI, Mayank RAWAT, Abhishek RAI