Abstract: A remote access method obtains a remote access function instruction including a first item parameter value, a first interface parameter value, a first cmdlist parameter value, and a first keylist parameter value. An access mode to a remote computer is determined according to the first item parameter value. A login type of the remote computer is determined according to the first interface parameter value and the access mode. After the remote computer is logged into, data is retrieved from the remote computer according to the first cmdlist parameter value. The data is processed according to the first keylist parameter value. The method improves access efficiency to remote computers.

Abstract: Methods, computer program products, and systems are presented. The methods include, for instance: collecting real time system statistics on a system environment in a remote platform running a remote data source amongst a plurality of remote data sources of a virtual database. Real time data source statistics on one or more data source objects from the remote data source of the virtual database is also gathered. A global catalog of the virtual database is updated with the real time system statistics and the real time data source statistics. An access plan to process a query to the virtual database is optimized based on the real time system statistics and the real time data source statistics and a response is produced based on the access plan, with improved performance and reduced cost.

Abstract: In a computer-implemented method for handling of an index update, time series data is received at an ingestion node of a time series data monitoring system. An index update is determined based on the time series data. The index update is stored to an index database of the time series data monitoring system. The index update is forward to a plurality of query nodes of the time series data monitoring system.

Abstract: A system and method for efficient query processing using a real index of a queried table are described. In one embodiment, the real index is used in an offset query type in order to reduce the number of rows that are sorted and thereby increases efficiency for processing offset query types. In another embodiment, the real index is used in a set operation query type where existing systems utilize a table scan and thereby increases efficiency of set operation query types.

Abstract: A workflow presentation receives electronic object from multiple sources, such as electronic messaging systems and document management systems. The system develops a hypergraph representation of the objects in which the objects appear, individually or in clusters, as edges along various rails of the hypergraph. Each rail represents a workstream to provide a visual representation of the electronic objects that are associated with one or more workstreams of a project.

Abstract: Systems and methods include presenting search results from multiple sources by grouping the results from some of the multiple sources, ranking each of the multiple sources and groups of sources, and not presenting duplicate results 5 from lower ranked sources. In this way, the user is provided with search results that are distinct as opposed to presenting the same result multiple times when it is available from different sources.

Abstract: A system and method for providing fine-grained access control in a search engine. Access control predicates associated with a search query, including fixed-width and/or variable-width tokens, are received from the search engine, and are formatted in a machine-readable binary format to generate a single byte array. A pre-sorted memory index structure associated with the single byte array is generated, by sorting the access control predicates according to their token width. The pre-sorted memory index structure is merge joined with an uninverted terms index that includes a sorted list of all terms in a field associated with the search query, and a document index mapping each document identifier (ID) to a term ordinal for a specific field.

Abstract: Methods, systems, and apparatus, including computer-readable media, for a hierarchical multi-tenant data access platforms. In some implementations, the a server system stores data collected through a multi-tenant data access platform configured to collect data for each of multiple tenant organizations and to selectively make the collected data available according to policies associated with the respective tenant organizations. The server system receives a request associated with a user, and the server system generates and provides a response according to the organization hierarchy data and policy data for the unit of the organization that has data that would be used in generating the response to the request.

Abstract: In the general, the subject matter of the present disclosure relates to a data analysis tool that helps consumers, such as data scientists and engineers, understand datasets better. The disclosed data analysis framework/tool surfaces metrics to data consumers to visually inspect and understand large datasets more efficiently. In addition to the pre-computed and pre-collected metrics on given datasets or tables, the disclosed data analysis tool may also provide a way to detect various anomalies associated with the datasets.

Abstract: The subject technology receives a statement to perform an operation to add a new column into a table. The subject technology generates a schema hash value for a new schema version associated with a new schema version value. The subject technology stores a mapping of the schema hash value to the new schema version value for the table in a metadata database. The subject technology stores a new schema entry based on the schema hash value, the new schema version value, and the new column for the table in the metadata database. The subject technology performs an operation to add the new column to the table.

Abstract: A system and method for efficiently maintaining metadata stored among a plurality of solid-state storage devices. A data storage subsystem supports multiple mapping tables. Records within a mapping table are arranged in multiple levels. Each level stores at least pairs of a key value and a physical pointer value. The levels are sorted by time. New records are inserted in a created new highest (youngest) level. No edits are performed in-place. A data storage controller determines both a cost of searching a given table exceeds a threshold and an amount of memory used to flatten levels exceeds a threshold. In response, the controller incrementally flattens selected levels within the table based on key ranges. After flattening the records in the selected levels within the key range, the records may be removed from the selected levels. The process repeats with another different key range.

Abstract: A query processing system operates by determining a query pricing scheme; receiving a query request from a requesting entity that indicates access to a subset of a plurality of records in a database system; generating query cost data based on the subset of the plurality of records by utilizing the query pricing scheme; and transmitting the query cost data to the requesting entity.

Abstract: A data model for managing custom fields for tasks in projects. The custom fields can be defined and shared across an organization, and are always unique. Each type of custom field is an object that is subclass of a generic object. Other objects define attributes of the custom fields and assign values to the attributes. The data model allows the custom fields to be preserved and managed across multiple projects and users.

Abstract: This application provides a search apparatus, including a global dispatcher, a global arbiter, and N search engines. The N search engines can access a first search table. The global dispatcher is configured to: determine that a first search keyword is corresponding to the first search table and dispatch the first search keyword to the N search engines. Each search engine is configured to: search, according to a first search algorithm, one subtable to determine whether an entry that matches the first search keyword exists; and output a search result to the global arbiter. The global arbiter is configured to arbitrate the search result output by each search engine, to obtain a search result corresponding to the first search table.

Abstract: Aspects include receiving a notification that a value of a data element stored in a source storage location in a source format has been changed to an updated value. The change is replicated to a plurality of target storage locations. The replicating includes, for each of the plurality of target storage locations, determining a target format of the data element in the target storage location. The target format is one of a plurality of different formats, including the source format. Each of the different formats provide a different level of data protection for the data element. In response to determining that the target format is not the same as the source format, the updated value of the data element is converted into the target format, and the updated value of the data element is stored in the target format at the target storage location.

Abstract: Some embodiments provide a novel method of performing health monitoring for resources associated with a global server load balancing (GSLB) system. This system is implemented by several domain name system (DNS) servers that perform DNS services for resources located at several geographically separate sites. The method identifies several different groupings of the resources. It then assigns the health monitoring of the different resource groups to different DNS servers. The method then configures each particular DNS server (1) to send health monitoring messages to the particular group of resources assigned to the particular DNS server, (2) to generate data by analyzing responses to the sent health monitoring messages, and (3) to distribute the generated data to the other DNS servers. The method in some embodiments is performed by a set of one or more controllers.

Abstract: A network device may receive data, may extract primary patterns from a plurality of domain names included in the data, may process the primary patterns, with a hash model, to generate hash keys for the primary patterns, wherein a hash key includes a hash value associated with a wildcard character, and may store the plurality of domain names in a hash table. The network device may extract a particular primary pattern from a particular domain name included in a search request, may determine potential matching patterns based on the particular primary pattern, and may process the potential matching patterns, with the hash model, to generate potential matching hash keys for the potential matching patterns, wherein a hash key includes a hash value associated with a wildcard character. The network device may search, based on the potential matching hash keys, the hash table to identify a matching domain name.

Abstract: A system and method is described for database split generation in a massively parallel or distributed database environment including a plurality of databases and a data warehouse layer providing data summarization and querying functionality. A database table accessor of the system obtains, from an associated client application, a query for data in a table of the data warehouse layer, wherein the query includes a user preference. The system obtains table data representative of properties of the table, and determines a splits generator in accordance with one or more of the user preference or the properties of the table. The system generates, by the selected splits generator, table splits dividing the user query into a plurality of query splits, and outputs the plurality of query splits to an associated plurality of mappers for execution by the associated plurality of mappers of each of the plurality of query splits against the table.

Abstract: A database structure and a system that uses the structure to facilitate efficient context enrichment of low-level events occurring in a distributed computing system. In one aspect, the database structure comprises a table accessible to a distributed storage system. The table comprises a plurality of rows. Each row represents a corresponding process creation event of a particular process at a particular host at a particular time and assigned a particular event identifier. Each row comprises a row key identifying the particular host, the particular process, the particular time, and the particular event identifier of the process creation event corresponding to the row. The particular time and the particular event identifier are stored as part of the row key in a bitwise one's complement format. The row key structure facilitates efficient identification of a process creation event where only hostname and the process identifier of the process creation event are known.

Abstract: Disclosed is a method performed by a database management system (DBMS) according to an exemplary embodiment of the present disclosure. The method may create a database index structure for pointing a data storage location based on monitoring result information depending on a monitoring algorithm in the database management system. The database index structure may at least partially include a sub index structure of a first level and a sub index structure of a second level which is lower than the first level, the second level sub index structure may include a plurality of columns, a first column among the plurality of columns of the second level sub index structure may include key values, a second column among the plurality of columns of the second level sub index structure may include ROWID values corresponding to rows of a data block, and a third column among the plurality of columns of the second level sub index structure may include optimized index values set based on the monitoring result information.

Abstract: A controller is provided to manage searching a storage system. A search query including a search term is received. The controller generates a set of tasks associated with conducting a search of the storage system for any objects in the storage system having the search term. These tasks are pushed onto a message queue. A set of workers are allocated to retrieve and process the tasks. A worker processes a task in parallel with another worker processing another task.

Abstract: Methods, systems, and computer-readable media for a bulk ingestion interface for a distributed data storage system are described. A bulk ingestion interface may allow bulk data to be ingested into a distributed data storage system using compute resources separate from respective compute resources of the distributed data storage system used to perform access requests to datasets stored on one or more resource hosts of the distributed data storage system.

Abstract: Disclosed is a computer-implemented method to adjust partition keys. The method includes identifying a target table that is a target of a query, the target table including a set of initial partitions. The method also includes determining a set of common queries, wherein each of the common queries are configured to retrieve data from the target table. The method further includes identifying a plurality of core ranges. The method includes merging the core ranges into a new set of partitions. The method further includes setting, in response to the merging, updated partition keys. Further aspects of the present disclosure are directed to systems and computer program products containing functionality consistent with the method described above.

Abstract: A database management system and a method for redundant storage of time-series data in a distributed data storage system with a plurality of storage media is disclosed. The method comprises dividing the time-series data into a plurality of data blocks, storing the plurality of data blocks on ones of the plurality of storage media, and redundantly storing a subset of time series data, which is contiguous in time to one of the plurality of data blocks, on the same one of the plurality of storage media as the contiguous one of the plurality of data blocks.

Abstract: In response to a query to a database, the identity of a slave machine which stores the requested data is resolved, and the query is parsed to identify one or more shards at the slave machine. Each shard corresponds to a partition of the requested data stored at the slave, and rows inside of the shard are respectively assigned a fixed-size local ID. Tasks corresponding to each shard are placed into a thread pool, and the threads are processed using the respective local IDs to obtain the requested data.

Abstract: Apparatus, methods, and computer-readable media facilitating reduction and incremental modeling through set theory prime factorization are disclosed herein. An example method includes identifying one or more topics associated with content of a social media message. The example method also includes mapping each of the one or more topics to a respective set key to generate a set list associated with the social media message. Additionally, the example method includes recording the set list associated with the social media message in memory.

Abstract: A system and method for managing permissions of users for a column-oriented data structure, including: generating a column oriented data structure in response to receiving a request to generate the data structure from a first user device associated with a first user account, wherein the data structure comprises a plurality of columns, wherein each column is of single data type and is assigned metadata associated with the single data type; associating the first user account with a first set of permissions associated with the generated data structure; and, associating a second user account with a second set of permissions, wherein the first set of permissions comprises at least one additional permission with respect to the second set of permissions.

Abstract: A distributed computing environment data store management system includes a computer-based system for identifying a subset of element records in a data store associated with the elements of a distributed computing environment, receiving at least one user-defined data element from a user interface. Using the user-defined data element, the system adds the user-defined data element to each of the subset of element records, and stores each of the subset of element records and their associated user-defined data in the database.

Abstract: A method for fetching a content from a web server to a client device is disclosed, using tunnel devices serving as intermediate devices. The client device accesses an acceleration server to receive a list of available tunnel devices. The requested content is partitioned into slices, and the client device sends a request for the slices to the available tunnel devices. The tunnel devices in turn fetch the slices from the data server, and send the slices to the client device, where the content is reconstructed from the received slices. A client device may also serve as a tunnel device, serving as an intermediate device to other client devices. Similarly, a tunnel device may also serve as a client device for fetching content from a data server. The selection of tunnel devices to be used by a client device may be in the acceleration server, in the client device, or in both.

Abstract: By analyzing execution of a set of transactions by an application, a set of actual code execution paths of the application are determined. From the set of actual code execution paths, a set of predicted execution paths of the application are predicted using an execution prediction model. The set of predicted execution paths includes the set of actual code execution paths. By determining that paths in the set of predicted execution paths have above a threshold similarity to each other, a cluster of predicted execution paths is identified. The cluster of predicted execution paths is recommended, using a recommendation model, for implementation as a single execution path in a revised version of the application.

Abstract: Embodiments of the present disclosure disclose a method and apparatus for processing information. A specific implementation of the method includes: acquiring a search result set related to a search statement inputted by a user; parsing the search statement to generate a first syntax tree, and parsing a search result in the search result set to generate a second syntax tree set; calculating a similarity between the search statement and the search result in the search result set using a pre-trained semantic matching model on the basis of the first syntax tree and the second syntax tree set, the semantic matching model being used to determine the similarity between the syntax trees; and sorting the search result in the search result set on the basis of the similarity between the search statement and the search result in the search result set, and pushing the sorted search result set to the user.

Abstract: Media content platforms are configured to received search queries and present results to those search queries. Media guidance applications may be configured to access content from multiple content platforms or sources. When a user provides a search query to a media guidance application configured to access multiple content sources, the inventions described herein present search results from multiple sources by grouping the results from some of the multiple sources, ranking each of the multiple sources and groups of sources, and not presenting duplicate results from lower ranked sources. In this way, the user is provided with search results that are distinct as opposed to presenting the same result multiple times when it is available from different sources.

Abstract: Aspects of the invention are configured to perform an operation comprising receiving a query specifying an AND condition and an OR condition, determining, based on an AND index structure, a set of documents, of a plurality of documents in a corpus, satisfying the AND condition of the query, computing a query similarity score for a first document in the set of documents, wherein the query similarity score is based on a first hash value computed for the OR condition of the query, a weight value for the OR condition, and a second hash value for the first document specified in an OR index, and returning an indication of the first document and the query similarity score as responsive to the query.

Abstract: A non-transitory computer-readable recording medium recording an indexed data generation program causing a computer to execute processing of generating ledger sheet output format data from ledger sheet data including a ledger sheet having a plurality of columns; generating index information for words, characters, or numerical values, the index information including positional information capable of specifying attributes of the plurality of columns and a positional relationship in the ledger sheet data between pieces of data corresponding to the plurality of columns included in the ledger sheet output format data; and outputting an output file including the index information and the ledger sheet output format data.

Abstract: A computer-implemented method, system, and non-transitory computer program product for work assignment for parallelized database synchronization. Data changes to a source database are identified from a change log for the source database. The data changes are batched into data change chunks of data changes. An estimated processing cost for processing of each of the data change chunks to apply the data changes in the data change chunks to a target database is determined. A priority queue in which the data change chunks are identified in order of estimated processing cost is generated. Each data change chunk identified in the priority queue is assigned to a processing thread in a plurality of processing threads for processing in order by estimated processing cost from higher estimated processing cost to lower estimated processing cost to apply the data changes in the data change chunks to the target database.

Abstract: A system and method are disclosed to facilitate a database tuning as a service offered by a cloud platform as a service provider. A throttling detection engine, associated with a database service instance, may periodically determine if an automated database tuning process should be performed. When it is determined that the automated database tuning process should be performed, the throttling detection engine may transmit database performance metrics. A database tuner as a service, coupled to the throttling detection engine, may access aggregated database performance metrics of the database service instance and determine a set of tunable parameters associated with the database service instance. The database tuner as a service may then execute the automated database tuning process to recommend, using an intelligent algorithm, a new set of configurations for the set of tunable parameters to be applied to the database service instance.

Abstract: The present invention relates to autonomous tuning of a data grid of documents in a database. Herein are techniques for storage cells to autonomously maintain local indices and other optimization metadata and algorithms to accelerate selective access into a distributed collection of documents. In an embodiment, each storage cell persists a respective subset of documents. Each storage cell stores, in memory, respective index(s) that map each item to location(s), in one or more documents of the respective subset of documents, where the item occurs. One or more computers execute, based on at least a subset of the indices of the storage cells, a data access request from a database management system. In an embodiment, a cloud of JSON document services provides an easy-to-use, fully autonomous JSON document database that horizontally and elastically scales to deliver fast execution of document transactions and queries without needing tuning by a database administrator.

Abstract: Techniques are disclosed relating to processing data stored within database tables in a parallelized manner. In various embodiments, a computer system maintains a database having a database table storing data for a plurality of tenants and an index structure storing indexes for accessing data stored in the database table. In some embodiments, the computer system receives, from a particular tenant, a request to perform a task that includes operating on particular data. In some embodiments, the computer system determines a portion of the index structure corresponding to the particular tenant and divides a range of indexes within that portion into a plurality of index sub-ranges. In various embodiments, the computer system processes portions of the task in parallel by determining an index sub-range for each of a plurality of threads and causing each of the threads to operate on a portion of the particular data specified by its index sub-range.

Abstract: A locally optimized plan for executing a command using a sequence of steps can be determined for a single computing node. However, the locally optimized sequence of steps may not be optimized for a combined system comprising multiple computing nodes, any one of which may be tasked with executing the command. A plan that is optimized for the combined system may be determined by comparing the predicted cost of locally optimized plans for computing nodes in the combined system.

Abstract: The subject technology creates partitions based on changes to a table, at least one of the one or more partitions overlapping with respect to values of one or more attributes with at least one of another partition and a previous partition. The subject technology maintains states for the partitions, each state from the plurality of states representing a particular degree of clustering of the table. The subject technology determines a number of overlapping partitions and a depth of the overlapping partitions, and determines a clustering ratio based at least in part on the number of overlapping partitions and the depth. The subject technology reclusters partitions of the table to increase the clustering ratio, the clustering ratio determined by at least a proportion of rows in a layout of the table that satisfy an ordering criteria based at least in part a particular attribute of the one or more attributes.

Abstract: A system, method and the like for front-end comprehensive validation of data files that require processing by multiple different computing systems having different validation requirements. Validation for all of the multiple different computing systems is performed upon receipt of the data file by the data processing entity and, as such, in the event that validation results in an error/failure, the originator/sender of the data file can be notified of the error failure proximate in time to when the data file is transmitted to the data processing entity and can re-submit a valid data file in due time. In addition, the present invention is configured to insure that the validation meets the current requirements of all the computing systems that process the data file by employing a centralized data file validation requirements database that stores validation requirements for each of the computing systems.

Abstract: The subject technology creates one or more partitions based on changes to a table, at least one of the one or more partitions overlapping with respect to values of one or more attributes with at least one of another partition and a previous partition, the creating of the one or more partitions resulting in a decrease in a degree of clustering of the table. The subject technology determines, after creating the one or more partitions, that the degree of clustering of the table is below a clustering threshold, the clustering threshold corresponding to a clustering ratio, the clustering ratio determined by at least a proportion of rows in a layout of the table that satisfy an ordering criteria based at least in part a particular attribute of the one or more attributes. The subject technology increases the degree of clustering of the table by reclustering partitions of the table.

Abstract: A method for execution by a query processing system includes receiving a query request from a requesting entity. Query cost data is generated based on the query request by utilizing a query pricing scheme. Minimum query cost compliance data is generated for the query request based on determining whether the minimum query cost data complies with a minimum query cost rule. When the minimum query cost compliance data indicates the minimum query cost data complies with the minimum query cost rule a query result is generated based on facilitating execution of the query by executing at least one query function of the query against a database system, and the query result is transmitted to the requesting entity. When the minimum query cost compliance data indicates the query cost data does not comply with the minimum query cost rule, the query result is not transmitted to the requesting entity.

Abstract: Computerized data management systems and methods for inter-relating, indexing, and organizing data records stored in a database or as computer files are described. The systems and methods can be used for linking or associating data records relating to real estate parcels. A given parcel in a community of parcels may have many neighbors. The systems and methods can identify a reduced set of neighbors of the parcel that have addresses that bracket the address of the parcel.

Abstract: In a computer-implemented method for proactive handling of an index update, a data point is received at an ingestion node of a time series data monitoring system. It is determined whether an update to a local index of the ingestion node is necessitated based on the data point and the local index. Provided the update to the local index is necessitated, an index entry corresponding to the data point in the local index is updated based on the data point. The index entry corresponding to the data point is marked with a volatile indicator, the volatile indicator indicating that receipt of an index update to a corresponding index entry at a durable index of the time series data monitoring system is unconfirmed. The index update to the durable index corresponding to the data point is initiated.

Abstract: A query server identifies data collections of interest in a cloud store, and categorizes the collections based on an intended usage. Depending on the intended usage, the categorized data may be cataloged, indexed, or undergo a full intake into a column store. In a database of large data collections, some collections may experience sparse or indefinite usage. Cataloging or indexing position the collections for subsequent query access, but defers the computational burden. The full intake performs a columnar shredding of the collection for facilitating eminent and regular query access. Upon invocation of query activity, an instantiation of virtual machines provided by the cloud store vendor implements query logic, such that the VMs launch in conjunction with the cloud store having the collections. Collections therefore incur processing based on their expected usage-full intake for high query traffic collections, and reduced cataloging for maintaining accessibility of collections of indefinite query interest.

Abstract: A deduplicated microservices-based storage system and method running in a cloud includes frontend and backend microservice nodes that process requests from a plurality of clients and interface with a master node and one or more worker nodes connected as a network for deduplicating, storing and retrieving data from object storage. A custom metric compares demand on system resources to thresholds and dynamically scales resources to add or eliminate resources according to demand. The master node partitions the range of values identifying data similarity groups across the worker nodes, reassigns ranges of values using consistent hashing as worker nodes are scaled, and maintains a mapping of ranges of values to worker IP addresses.

Abstract: The subject technology creates partitions based on changes to a table, at least one of the one or more partitions overlapping with respect to values of one or more attributes with at least one of another partition and a previous partition. The subject technology maintains states for the partitions, each state from the plurality of states representing a particular degree of clustering of the table. The subject technology determines a number of overlapping partitions and a depth of the overlapping partitions, and determines a clustering ratio based at least in part on the number of overlapping partitions and the depth. The subject technology reclusters partitions of the table to increase the clustering ratio, the clustering ratio determined by at least a proportion of rows in a layout of the table that satisfy an ordering criteria based at least in part a particular attribute of the one or more attributes.

Abstract: A fast index creation system for a cloud big data database electrically and communicatively coupled to a cloud non-relational database for inquiring and creating an index includes an application exchange module, a data exchange module, a first processing module, a second processing module and an integrated processing module. The application exchange module receives a query string inputted by a user and prompts a result index table. The data exchange module has a temporary index table. The first processing module computes the query string and generates a query instruction to compute a temporary index table for comparison and check if there is any data matched with the query instruction. If yes, then the first processing module will generate a cache index table, or else the first module will generate a create instruction provided for the second processing module to compute a non-relational database and generate a new index table.

Abstract: Certain aspects provide systems and methods for performing an operation on a B?-tree. A method comprises writing a message associated with the operation to a first slot in a first buffer of a first non-leaf node of the B?-tree in an append-only manner, wherein a first filter associated with the first slot is used for query operations associated with the first slot. The method further comprises determining that the first buffer is full and, upon determining to flush the message to a non-leaf child node, flushing the message in an append-only manner to a second slot in a second buffer of the non-leaf child node, wherein a second filter associated with the second slot is used for query operations associated with the second slot. The method further comprises, upon determining to flush the message to a leaf node, flushing the message to the leaf node in a sorted manner.