Abstract: A database access control method and apparatus are disclosed. The method is applied to a database system. The database system has at least two databases, and the at least two databases include a first database and a second database. One example method includes: receiving an access request from the application, determining that a target database to which the access request is sent is the second database; establishing a database connection between a connection agent and the second database, and sending the access request to the second database by using the connection agent.

Abstract: A system is configured to ensure transactional integrity thereof. The system includes a first subsystem and a second subsystem. Each of the subsystems receive the same request to process a transaction. An indicia engine at each subsystem computes indicia of the outcome of the processing of the same request. The computed indicia from each of the subsystems is compared. An action is completed at one of the subsystems when the computed indicia does not match. The action completed at one of the subsystems is one or more of issuing a database rollback on one of the subsystems, executing self-diagnostics on one of the subsystems, shutting down one of the subsystems, taking one of the subsystems offline, aborting the transaction executing on one of the subsystems, and generating an error indication for one of the subsystems.

Abstract: The system, for facilitating access to data in a database, includes a computing device communicatively coupled with a communications network and with the user interface, the computing device configured for transmitting the database query over the communications network; a server communicatively coupled with the communications network, the server configured for: a) receiving the database query transmitted by the computing device, and storing the database query in association with a user record corresponding to the user; b) accessing the database to retrieve responsive data from the database in response to the database query; c) processing the responsive data to produce a virtual 3D image of the responsive data, wherein the 3D virtual image is configured to be manipulated by the user; d) transmitting the 3D image of the responsive data to the computing device over the communications network.

Abstract: Methods and systems for efficient query rewriting and the like are described here. One such described method comprises: offline mapping frequently-seen search queries to rewritten queries that may be better for searching; offline caching the mapping in a cache memory; and upon receiving a search query from a user similar to one of the mapped search queries, obtaining a corresponding rewritten query from the mapping in the cache memory based on predetermined conditions, and issuing a search of the rewritten query to the backend data system in order to avoid having to issue a search query to the backend data system twice while the user is online.

Abstract: Techniques are described herein for executing queries with a recursive clause using a plurality of processes that execute database operations in parallel. Each process of the plurality of processes either generate or are assigned a segment that is part of a temporary table. For each iteration of the recursive query, work granules are divided up and assigned to each of the plurality of processes. As each respective process produces a portion of a result set for a given iteration, that process appends said portion of the result set to the respective segment that the respective process manages. Each slave process then publishes, to one or more sources, a reference to the newly generated results. During the next iteration, any slave process may access any of the data from the previous iteration.

Abstract: Techniques are provided for eager replication of uncommitted transactions. In embodiments, a replication client receives, in a data stream, change records corresponding to database changes applied to a source database in a transaction. The change records does not include a commit record that indicates that the transaction is committed on the source database. Before receiving the commit record, the replication client computes transaction dependency data based on the change records and detects, based on the transaction dependency data, that the transaction can be at least partially applied to a target database. Also before receiving the commit record, the replication client applies, to a target database and based on the detecting, at least some of the change records. Upon receiving the commit record of the transaction, the replication client completes applying the change records and commits the transaction on the target database.

Abstract: Apparatuses, methods, and storage medium associated with a browser for prioritized display of videos and/or photographs are disclosed herein. In embodiments, an apparatus may include one or more processors, devices, and/or circuitry to operate a browser to present a plurality of photos and/or videos for viewing. A subset of the plurality of the photos and/or videos may be selected based on the results of an analysis of sensor data collected by a plurality of wearable sensors. The subset of the plurality of the photos and/or videos may be prioritized over other photos and/or videos from the plurality of the photos and/or videos in terms of presentation space allocated for presentation.

Abstract: An information management system according to certain aspects may be configured to generate a snapshot of data relating to a plurality of applications. The system may include a plurality of data agents, wherein each data agent is associated with at least one of a plurality of applications, and data generated by the plurality of applications is stored in a logical volume in primary storage. The system may also include a snapshot manager configured to detect the plurality of applications; check with the plurality of data agents whether the associated applications are in consistent states; obtain a snapshot of the logical volume in response to receiving notifications from the plurality of data agents that the associated applications are in consistent states; and generate mapping information between a particular one of the plurality of applications and a portion of the snapshot relating to the particular one of the plurality of applications.

Abstract: The present invention may be a method, a computer system, and a computer program product. An embodiment of the present invention provides a method for finding a problem in procedures described in a guide document for install and configuration of software. The method comprises calculating, using a dynamic programming matching, a distance between an install-and-configuration log generated by executing the install and configuration of the software according to the guide document at a user-side computer and a log template generated by executing the install and configuration of the software according to the guide document at an administrator-side computer, and finding a problem in the procedures, using the distance.

Abstract: A method is provided for performing transaction processing in a system that includes a transaction distributor and a plurality of nodes. Each of the nodes include a processor, an application executing in the processor, and an instance of a database used by the application. Each node executes transactions. The transaction distributor selects at least two of the nodes to receive the same request to process a transaction, and the processor at each of the at least two nodes executes the same request to process a transaction. Each of the at least two nodes replicates to one or more other nodes in the system the steps and operations of the transactions up until a transaction END step. A check integrity module determines if the transaction integrity should be checked.

Abstract: In an aspect, provided is a method comprising receiving a data model, generating a bidirectional table index (BTI) based on the data model, generating a bidirectional association index (BAI) based on the data model and the bidirectional table index, and loading a portion of the data model, the BAI, and the BTI in-memory.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for dynamically suggesting answers to questions submitted to a portal of an online service. These mechanisms and methods for dynamically suggesting answers to questions submitted to a portal of an online service can enable embodiments to provide help document suggestions with limited user input. The ability of embodiments to provide help document search term suggestions with limited user input can enable users to quickly and efficiently find useful help documents.

Abstract: A computing resource service provider implements a verification engine for hierarchical data structures. The verification engine uses a work item queue, a node allocation counter list, and a memory deallocation list to increase parallelism and thread utilization during verification operations involving ordered, nominally sorted data structures.

Abstract: A database analysis service implements techniques for determining recommended database instance types for migration. A first set of metrics is generated for a database system and one or more database instances is instantiated so that a corresponding second set of metrics can be generated for each of the database instances. Suitable instance types are identified by comparing the corresponding second set of metrics to the first set of metrics to determine whether the instance increases database performance.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, modifying queries based on non-textual content. In one aspect, a method includes receiving, from a user device, a query including a plurality of terms; determining active non-textual data displayed in an application environment on the user device; determining, from the non-textual textual data, modification data for the query; generating a set of modified queries based on the query and the modification parameters; scoring the modified queries according to one or more scoring criteria; selecting one of the modified queries based on the scoring; and providing, to the user device, search results responsive to the selected modified query.

Abstract: Flexible, high-accuracy data processing techniques and accompanying systems avoid criticality in intermediate computations through intelligent, low cost sanitization of data operations. A data processing operation including one or more plans is received, with each plan having a data operation described as a tree based-structure. The plans that are determined to create criticality on execution are sanitized by transforming the plan itself, ancestors, and/or children of the plan. Determining whether execution of a plan creates criticality is based on the determination of whether a set of criticality conditions includes data signals that are associated with the plan. After sanitization, the data processing operation can be fully executed without criticality arising in intermediate operations.

Abstract: One or more embodiments include scheduling a new operation to be periodically executed. A start time for a new operation, to be periodically executed, is determined based on the start times of previously scheduled operations. The difference in value between a candidate start time and a start time of a previously scheduled operation is used to compute a cost for the candidate start time. A candidate start time, of all the candidate start times, with a lowest cost may be selected as the start time for the new operation.

Abstract: Techniques are described herein for performing join and aggregation operations for a received query using column dictionaries. In an embodiment, a query is received that requests to aggregate a measure column of a fact table based on an aggregate function and join the fact table with a dimension table on a join key column. Data of the fact table may be stored in one or more storage data units, for example a particular data portion of the fact table may be stored on a particular data storage unit. The respective data portion may include one or more column vectors corresponding to one or more columns of the fact table in which a cell element corresponds to a value at a particular row and a particular column of the one or more columns of the fact table. The cell element of the one or more column vectors includes a dictionary encoded value of the value at the particular column and row. This dictionary encoded value is mapped to the value of by a dictionary data structure of the particular column.

Abstract: The Prefix Burrows-Wheeler Transform (“PWBT”) is described to provide data operations on data sets even if the data set has been compressed. Techniques to set up a PWBT, including an offset table and a prefix table, and techniques to apply data operations on data sets transformed by PWBT are also described. Data operations include k-Mer substring search. General applications of techniques using PWBT, such as plagiarism searches and open source clearance, are described. Bioinformatics applications of the PWBT, such as genomic analysis and genomic tagging, are also described.

Abstract: In accordance with an embodiment, the system enables access to a sharded database using a cache and a shard topology. A shard-aware client application connecting to a sharded database can use a connection pool (e.g., a Universal Connection Pool, UCP), to store or access connections to different shards or chunks of the sharded database within a shared pool. As new connections are created, a shard topology layer can be built at the database driver layer, which learns and caches shard key ranges to locations of shards. The shard topology layer enables subsequent connection requests from a client application to use a fast key path access to the appropriate shard or chunk.