Patent classifications
G06F16/24553
Efficient traversal of hierarchical datasets
In one embodiment, a method comprises receiving a request for a particular user identification (ID) to perform a particular operation on a particular data object. An entitlement cache associates each operation that the particular user ID is entitled to perform with a first encoding of a tuple of a plurality of tuples. An object mapping cache associates each tuple of the plurality of tuples with a second encoding of each tuple of the plurality of tuples. An object mapping is used to determine a first tuple. The object mapping cache is used to determine a first vector of one of more left values based on the first tuple. The entitlement cache is used to determine a second vector of one or more value pairs. In response to identifying a match between the first vector and the second vector, the particular user ID is granted access to the particular data object.
SYSTEMS AND METHODS FOR MANAGING STRUCTURED QUERY LANGUAGE ON DYNAMIC SCHEMA DATABASES
In various aspects of the present disclosure, systems and methods are described to identify and resolve structured queries so they execute consistently and accurately against any data architecture, and for example, dynamic or unstructured database stores. According to one embodiment, a dynamic schema data system implements a query dialect that is configured to expose underlying flexible schemas of the dynamic schema data system, any structured data, unstructured or partially structured data, and expressive querying native to the dynamic schema system in a language that is compatible with structured queries, and for example, compatible with SQL-92. In further embodiments, the query dialect is configured to enable consistency with existing dynamic schema database query semantics (e.g., the known MongoDB database and associated query semantics).
Dynamic updating of query result displays
Described are methods, systems and computer readable media for dynamic updating of query result displays.
DATA PROCESSING SYSTEM
Disclosed is a data processing system comprising a database arrangement and at least one processor coupled in communication with the database arrangement. The at least one processor is configured to obtain, from the database arrangement, labelled training data; process 5 the labelled training data using at least one machine learning algorithm to generate a data processing model; obtain, from the database arrangement or a user device, at least one test document; process the at least one test document using the data processing model to extract key information from the at least one test document; and compare the 10 extracted key information with reference key information to identify whether or not there exist inconsistencies between the extracted key information and the reference key information.
UTILIZING ARRAY FIELD DISTRIBUTION DATA IN DATABASE SYSTEMS
A method includes generating array field distribution data for an array field of a dataset. A query expression for execution that includes a query predicate indicating the array field of the dataset is received. The array field distribution data for the array field is utilized to generate query plan data for the query expression based on the query expression including the query predicate indicating the array field. Execution of the query expression is facilitated in accordance with the query plan data.
SYSTEM PERFORMANCE LOGGING OF COMPLEX REMOTE QUERY PROCESSOR QUERY OPERATIONS
Described are methods, systems and computer readable media for performance logging of complex query operations.
STOP WORD IDENTIFICATION METHOD AND APPARATUS
The present application relates to the field of computer technologies, and in particular, to a stop word identification method used in an information retrieval system. In a stop word identification method, after a first query input by a user is acquired, a second query that belongs to a same session as the first query is acquired, and a stop word in the first query is identified according to a change-based feature of each word in the first query relative to the second query. According to the solution provided by the present application, a stop word in a query can be identified more accurately, and efficiency and precision of an information retrieval system are improved.
TIME SERIES DATA QUERY ENGINE
In one aspect, there is provided a system configured to receive time series data collected by a first sensor. The time series data collected by the first sensor can be stored in a first data array associated with the first sensor. The first data array can stored proximate to a second data array that includes time series data collected by a second sensor. The first data array can be stored proximate to the second data array based on the first and second sensor being in a same sensor group. A query can be received to perform a processing algorithm on a subset of time series data. The subset can be generated by retrieving the first and second data array. The query can be executed by applying the processing algorithm to the subset of time series data. Related methods and articles of manufacture are also provided.
COMPUTER DATA SYSTEM DATA SOURCE REFRESHING USING AN UPDATE PROPAGATION GRAPH
Described are methods, systems and computer readable media for data source refreshing.
Methods for updating reference count and shared objects in a concurrent system
A method for to manage concurrent access to a shared resource in a distributed computing environment. A reference counter counts is incremented for every use of an object subtype in a session and decremented for every release of an object subtype in a session. A session counter is incremented upon the first instance of fetching an object type into a session cache and decremented upon having no instances of the object type in use in the session. When both the reference counter and the session counter are zero, the object type may be removed from the cache.