Microsoft Technology Licensing, LLC

Splunk Inc.

Bradford H Lovering

John Peter Shewchuk

Donald F Box

Steven E Lucco

Erik B Christensen

Giovanni Moises Della-Libera

Jeffrey C Schlimmer

Christopher G Kaler

David E Langworthy

Stephen James Millet

Itay Alfred Neeman

John David Doty

Luis Felipe Cabrera

David Wortendyke

David Edwin Levin

Paul J Leach

Richard F Rashid

Butler W Lampson

John Lawrence Hamby

Scott A Konersmann

Henrik Frystyk Nielsen

Andrew Donald Gordon

Gavin Mark Bierman

Anders Hejlsberg

Andrew Layman

Stefan Harrington Pharies

Robert S Wahbe

Craig Andrew Critchley

Geary L Eppley

Patrick Dengler

Peter H Golde

Jeffrey S Pinkston

Mark S Igra

Tom Corbett

Hong Yuan

Dinesh Sharma

Zi Liang Chen

Alexander Binkin

Daniel Ron Simon

Kenneth David Wolf

Gopala Krishna R Kakivaya

Richard L Hasha

Clemens Alden Szyperski

Nicholas John Filippi

Randy S Kimmerly

Brad Olenick

Christopher L Anderson

Haroon Ahmed

Finlay Cannon

Anthony J Moore

Alfred Lee

Michael Marucheck

Pedram Faghihi Rezaei

Michael Steven Vernal

Stephen T Swartz

Gershom L Payzer

Shy Cohen

George Prentice Copeland

Max A Feingold

Hema Krishnamurthy Mohan

Douglas M Purdy

Natasha Harish Jethanandani

William Emeric Aitken

Noaa Avital

Simon David Kent

Sowmyanarayanan K Srinivasan

Jason Walken Falk

Quetzal Bradley

Stevan Swartz

Destry W Hood

Michael Abbott

Waingold L Elliot

Steven E Luocco

Tram Theresa Vu

David A Wortendyke

David E Levin

A computerized method is disclosed for storing data using a persistent queue. The computerized method includes operations of obtaining machine data from a remote electronic device, providing the machine data to a persistent queue component, wherein the persistent queue component organizes the machine data for storage on a first data store and storing a copy of the organized machine data in the first data store, and responsive to completion of the storing of the copy of the organized machine data. Further operations include transmitting an acknowledgement communication to the remote electronic device indicating storage of the copy of the machine data in the first data store, processing the machine data for storage, and responsive to completion of the storing of the processed machine data in a second data store, deleting the copy of the machine data from the first data store. The persistent queue component may include a socket server.

System and method for storage of data utilizing a persistent queue

A search and data analysis collaboration system is described. The search and data analysis collaboration system enables users to search for and process stored data, and further includes a home page component that can help guide users embarking on data analyses; a discovery component that enables users to discover what data is available for search and analysis; a search component that enables users to efficiently search accessible data and to iterate on search queries and corresponding results; a workbooks component that enables users to create aggregated collections of data analysis artifacts; and an actions component that enables users to configure various actions to be performed in response to analyses.

Search and data analysis collaboration system

Technologies are described herein for executing queries expressed with reference to a structured query language against unstructured data. A user issues a structured query through a traditional structured data management ('SDM') application. Upon receiving the structured query, an SDM driver analyzes the structured query and extracts a data structure from the unstructured data, if necessary. The structured query is then converted to an unstructured query based on the extracted data structure. The converted unstructured query may then be executed against the unstructured data. Results from the query are reorganized into structured data utilizing the extracted data structure and are then presented to the user through the SDM application.

Hybrid structured/unstructured search and query system

A computerized method is disclosed. Operations of the method include obtaining, by a data retrieval component, the data from a remote electronic device, storing a copy of the data in a first data store, providing an acknowledgement to the remote electronic device based on storage of the copy of the data in the first data store, parsing the data into one or more time-based events, storing the one or more time-based events in a second data store, and deleting the copy of at least the portion of the data from the first data store.

Event collector with stateless data ingestion

Searching unstructured data in response to structured queries

Query conversion for converting structured queries into unstructured queries for searching unstructured data

Conversion of structured queries into unstructured queries for searching unstructured data store including timestamped raw machine data

Executing structured queries on text records of unstructured data

A common intermediate representation for a data scripting language is provided for efficient representation and direct specification of programming constructs in memory. The common intermediate representation of data scripts allows data intensive applications to be created and analyzed in a machine accessible format, and the elements of the common intermediate representation can be stored independent of underlying storage specifics. Stored elements of the common intermediate representation of code are thus available for fast loading in memory when desired by other applications and programs by mapping the stored elements to the in memory intermediate representation.

Common intermediate representation for data scripting language

Executing structured queries on unstructured data

An efficient, logical and expressive type system is provided for flexibly defining types of a declarative programming language so that efficient and structurally compact data intensive applications can be generated. The type system supports the combination of refinement types and type membership expressions, as well as a top type that encompasses all valid values as members. With the type system, types can be expressed as intersections and/or unions of other types. Thus, types can be efficiently represented for a full range of types of data as may be found in real world data stores.

Type system for declarative data scripting language

A particular method includes receiving credentials during execution of an application at a computing device. The credentials are evaluated to determine whether a user associated with the credentials is authorized to edit the application while the application is being executed. Upon determining that the user is authorized, an editing control is enabled during the execution of the application. The editing control is associated with a graphical user interface (GUI) element of the application and is operable to update the GUI element during execution of the application.

Selectively enabling runtime editing of an application

Changes are managed in a multi-user database application environment. Proposed changes are collected, including changes to data, schema, and/or application descriptions. A user may specify foreign key relationships between items belonging to one or more of these categories. A view is produced showing the impact proposed changes would have on the environment if successfully committed. The user's proposed changes are ordered according to their dependencies, and submitted for committal together in a single transaction, subject to optimistic concurrency and consistency checks. For example, a proposed change to a data value may be inconsistent with a change which removed a data element containing the data value. The commitment operation may return identifiers and other return values, in addition to indicating whether the commitment was successful.

Unified concurrent changes to data, schema, and application

An efficient, logical and expressive type system supports the combination of refinement types and type membership expressions, as well as a top type that encompasses all valid values as members. A bidirectional type checking algorithm is provided for the type system including synthesis and checking steps to statically verify types of code based on the type system.

Bidirectional type checking for declarative data scripting language

Growing community of inventors

Clyde Hill, WA, United States of America

Bradford H Lovering