Patents by Inventor Eric Eilebrecht
Eric Eilebrecht 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).
-
Patent number: 11914596Abstract: An example method of parsing data in a distributed computing system includes assigning a worker k to scan a data chunk k at a data storage node at which data chunk k is stored, each of one or more data chunks including a partial record, receiving, from each worker k, a number of instances of a context-varying symbol, a position in the data chunk k of a first instance of a context-dependent symbol after an even number of instances of the context-varying symbol, and a position in the data chunk k of a first instance of the context-dependent symbol after an odd number of instances of the context-varying symbol, for each data chunk that includes a partial record, computing an adjusted data chunk including data from a later data chunk to complete the partial record, parsing the adjusted data chunks and executing a query against the plurality of records.Type: GrantFiled: March 30, 2022Date of Patent: February 27, 2024Assignee: Microsoft Technology Licensing, LLCInventor: Eric Eilebrecht
-
Patent number: 11775528Abstract: Embodiments of the present disclosure are directed a distributed storage system that supports query data. One embodiment provides, at a front-end node, a method comprising receiving a query regarding data stored in an object, obtaining information identifying data nodes at which blocks of the object are stored, sending, to a first data node, a query regarding data in a first block, and receiving results for the query regarding the data in the first block comprising an incomplete record. The method further comprises sending, to a second data node, a query regarding data in a second block comprising the incomplete record, the second block being stored on a different physical device than the first block, and receiving results for the query regarding the data in the second block. The method further comprises outputting the results for the queries regarding the data in the first block and the data in the second block.Type: GrantFiled: July 26, 2021Date of Patent: October 3, 2023Assignee: Microsoft Technology Licensing, LLCInventors: Eric Eilebrecht, Karthick Krishnamoorthy, Maneesh Sah
-
Publication number: 20220222258Abstract: An example method of parsing data in a distributed computing system includes assigning a worker k to scan a data chunk k at a data storage node at which data chunk k is stored, each of one or more data chunks including a partial record, receiving, from each worker k, a number of instances of a context-varying symbol, a position in the data chunk k of a first instance of a context-dependent symbol after an even number of instances of the context-varying symbol, and a position in the data chunk k of a first instance of the context-dependent symbol after an odd number of instances of the context-varying symbol, for each data chunk that includes a partial record, computing an adjusted data chunk including data from a later data chunk to complete the partial record, parsing the adjusted data chunks and executing a query against the plurality of records.Type: ApplicationFiled: March 30, 2022Publication date: July 14, 2022Applicant: Microsoft Technology Licensing, LLCInventor: Eric EILEBRECHT
-
Patent number: 11301474Abstract: An example method of parsing data in a distributed computing system includes assigning a worker k to scan a data chunk k at a data storage node at which data chunk k is stored, each of one or more data chunks including a partial record, receiving, from each worker k, a number of instances of a context-varying symbol, a position in the data chunk k of a first instance of a context-dependent symbol after an even number of instances of the context-varying symbol, and a position in the data chunk k of a first instance of the context-dependent symbol after an odd number of instances of the context-varying symbol, for each data chunk that includes a partial record, computing an adjusted data chunk including data from a later data chunk to complete the partial record, parsing the adjusted data chunks and executing a query against the plurality of records.Type: GrantFiled: July 1, 2019Date of Patent: April 12, 2022Assignee: Microsoft Technology Licensing, LLCInventor: Eric Eilebrecht
-
Publication number: 20210349905Abstract: Examples are disclosed that relate to querying data in a distributed storage system. One example provides, at a front-end node, a method comprising receiving a query regarding data stored in an object, obtaining information identifying data nodes at which blocks of the object are stored, sending, to a first data node, a query regarding data in a first block, and receiving results for the query regarding the data in the first block comprising an incomplete record. The method further comprises sending, to a second data node, a query regarding data in a second block comprising the incomplete record, the second block being stored on a different physical device than the first block, and receiving results for the query regarding the data in the second block. The method further comprises outputting the results for the queries regarding the data in the first block and the data in the second block.Type: ApplicationFiled: July 26, 2021Publication date: November 11, 2021Applicant: Microsoft Technology Licensing, LLCInventors: Eric EILEBRECHT, Karthick KRISHNAMOORTHY, Maneesh SAH
-
Patent number: 11100109Abstract: One example provides, at a front-end node of a distributed storage system, a method comprising receiving a query regarding data stored in an object, obtaining information identifying data nodes at which blocks of the object are stored, sending, to a first data node, a query regarding data in a first block, and receiving results for the query regarding the data in the first block comprising an incomplete record. The method further comprises sending, to a second data node, a query regarding data in a second block comprising the incomplete record, the second block being stored on a different physical device than the first block, and receiving results for the query regarding the data in the second block. The method further comprises outputting the results for the queries regarding the data in the first block and the data in the second block.Type: GrantFiled: July 9, 2019Date of Patent: August 24, 2021Assignee: Microsoft Technology Licensing, LLCInventors: Eric Eilebrecht, Karthick Krishnamoorthy, Maneesh Sah
-
Publication number: 20200349164Abstract: An example method of parsing data in a distributed computing system includes assigning a worker k to scan a data chunk k at a data storage node at which data chunk k is stored, each of one or more data chunks including a partial record, receiving, from each worker k, a number of instances of a context-varying symbol, a position in the data chunk k of a first instance of a context-dependent symbol after an even number of instances of the context-varying symbol, and a position in the data chunk k of a first instance of the context-dependent symbol after an odd number of instances of the context-varying symbol, for each data chunk that includes a partial record, computing an adjusted data chunk including data from a later data chunk to complete the partial record, parsing the adjusted data chunks and executing a query against the plurality of records.Type: ApplicationFiled: July 1, 2019Publication date: November 5, 2020Applicant: Microsoft Technology Licensing, LLCInventor: Eric EILEBRECHT
-
Publication number: 20200349166Abstract: Examples are disclosed that relate to querying data in a distributed storage system. One example provides, at a front-end node, a method comprising receiving a query regarding data stored in an object, obtaining information identifying data nodes at which blocks of the object are stored, sending, to a first data node, a query regarding data in a first block, and receiving results for the query regarding the data in the first block comprising an incomplete record. The method further comprises sending, to a second data node, a query regarding data in a second block comprising the incomplete record, the second block being stored on a different physical device than the first block, and receiving results for the query regarding the data in the second block. The method further comprises outputting the results for the queries regarding the data in the first block and the data in the second block.Type: ApplicationFiled: July 9, 2019Publication date: November 5, 2020Applicant: Microsoft Technology Licensing, LLCInventors: Eric EILEBRECHT, Karthick KRISHNAMOORTHY, Maneesh SAH
-
Patent number: 8185693Abstract: Target data is allocated into caches of a shared-memory multiprocessor system during a runtime environment. The target data includes a plurality of data items that are allocated onto separate cache lines. Each data item is allocated on a separate cache line regardless of the size of the cache line of the system. The data items become members of a wrapper types when data items are value types. The runtime environment maintains a set of wrapper types of various sizes that are of typical cache line sizes. Garbage data is inserted into the cache line in cases where data items are reference types and data is stored on a managed heap. The allocation also configures garbage collectors in the runtime environment not to slide multiple data items onto the same cache line. Other examples are included where a developer can augment the runtime environment to be aware of cache line sizes.Type: GrantFiled: March 17, 2009Date of Patent: May 22, 2012Assignee: Microsoft CorporationInventors: Stephen H. Toub, John Duffy, Eric Eilebrecht
-
Publication number: 20100241808Abstract: Target data is allocated into caches of a shared-memory multiprocessor system during a runtime environment. The target data includes a plurality of data items that are allocated onto separate cache lines. Each data item is allocated on a separate cache line regardless of the size of the cache line of the system. The data items become members of a wrapper types when data items are value types. The runtime environment maintains a set of wrapper types of various sizes that are of typical cache line sizes. Garbage data is inserted into the cache line in cases where data items are reference types and data is stored on a managed heap. The allocation also configures garbage collectors in the runtime environment not to slide multiple data items onto the same cache line. Other examples are included where a developer can augment the runtime environment to be aware of cache line sizes.Type: ApplicationFiled: March 17, 2009Publication date: September 23, 2010Applicant: MICROSOFT CORPORATIONInventors: Stephen H. Toub, John Duffy, Eric Eilebrecht
-
Publication number: 20070124463Abstract: Methods and computer program products are disclosed for providing QoS for Web applications via an internet service application programming interface “ISAPI”) filter running on an internet information server, wherein the ISAPI filter uses a traffic control application programming interface to manage bandwidth for individual HTTP requests. Responses to HTTP requests can be prioritized based on policies defined by the Web application developer, wherein policy decisions may be made based on many different parameters, such as, for example, the IP address of the Web browser making the request, the type of browser being used, HTTP “cookies,” the uniform resource locator being requested, an authenticated user ID, or any other information that is exposed from the Internet information server through server variables. The present invention accomplishes this with no modifications to the internet information server, and with very minimal changes to the Web application.Type: ApplicationFiled: January 26, 2007Publication date: May 31, 2007Applicant: Microsoft CorporationInventors: Shreedhar Madhavapeddi, Rajesh Sundaram, Eric Eilebrecht
-
Publication number: 20050172276Abstract: In an implementation of an XML-based preprocessor, a programmed source file is parsed to generate a syntactic representation of the programmed source file. An XML (Extensible Markup Language) document is generated from the syntactic representation of the programmed source file, and a transform is applied to the XML document to generate a modified XML document from which an output file is generated in a format of the programmed source file.Type: ApplicationFiled: January 30, 2004Publication date: August 4, 2005Inventor: Eric Eilebrecht