Abstract: A system, for example, an online system or a database system schedules requests received for execution. The system maintains consumer groups and receives a measure of amount of resources allocated for each consumer group. The system maintains a measure of accumulated elapsed time of execution of requests received from each consumer group. If the system determines that resources are available for executing a request, the system selects a request for execution from a consumer group based on the measure of accumulated elapsed time for processing queries for the consumer group and the measure of amount of resources allocated for the consumer group. The system maintains relative cumulative elapsed times of queries across consumer groups in the same ratio as the allocated share for the consumer groups. Accordingly, the system schedules requests such that each consumer group approaches its allocation of resources compared to other groups smoothly over time.

Abstract: A computer-implemented method is disclosed for speeding up database access of electronic design automation (EDA) tool which utilizes a database manager for file access. The EDA tool accesses a plurality of design files, and each of the plurality of design files is associated with one of a plurality of design units for an integrated circuit (IC). The plurality of design files are encapsulated into an archive file which comprises a plurality of data units, wherein each of the data units corresponds to a design file. A request to access a design file will be redirected to access the archive file. The design file is then accessed by accessing the corresponding data unit in the archive file.

Abstract: Method and system are provided for writing output from map-reduce jobs to an archive file. The method may include providing an archive manager and exposing an interface to be called from map-reduce jobs to output to an archive file in a map-reduce distributed file system. The method may also include using a buffering database as a temporary cache to buffer updates to the archive file. Handling by the archive manager calls from map-reduce jobs may allow: reading directly from an archive file or from a job index at the buffering database; writing to a job index at the buffering database used as a temporary cache to buffer updates; and serializing updates from the buffering database to the archive file.

Abstract: A technique for storing data in a data storage system includes receiving, from a host, a request specifying a set of data to be written to a first file system, the first file system realized as a file within a second file system. A first log entry is created for the set of data in a first data log, which logs data to be written to the first file system, and a second log entry is created for the set of data in a second data log, which logs data to be written to the second file system. The first log entry provides a reference to the second log entry. The technique further includes storing the data in the cache page and acknowledging the host.

Abstract: Embodiments are described herein that provide searches, including a multi-dimensional search, a cross-source search, or both in a media playback system. The search can be initiated by way of a selection of a location on user interface of a controller. The location corresponds to one or more metadata that is used in the search. Results are sorted and displayed. In some embodiments, the one or more metadata is used to filter and/or sort the results.

Abstract: A technique relates to flash-optimized data layout of a dataset for queries. Selection columns are stored in flash memory according to a selection optimized layout, where the selection optimized layout is configured to optimize predicate matching and data skipping. The selection optimized layout, for each selection column, is formed by storing a selection column dictionary filled with unique data values in a given selection column, where the unique data values are stored in sorted order in the selection column dictionary. Row position designations are stored corresponding to each row position that the unique data values are present within the given selection column, without duplicating storage of any of the unique data values that occur more than once in the given selection column.

Abstract: A data element of a linked data structure is atomically moved without delaying lockless readers. A status-indicating entity is allocated, associated with the data element, and indicates validity of the data element with respect to the first linked data structure. A copy element, or a pointer thereto, is created from the data element. The status-indicating entity is associated with the copy element and indicates no validity of the copy element with respect to a second linked data structure. The copy element is linked to the second linked data structure. The status-indicating entity is atomically updated to indicate no validity of the data element with respect to the first linked data structure and validity of the copy element with respect to the second linked data structure. The data element is deleted and the status-indicating entity is disassociated from the copy element. Both structures may be deallocated in a deferred reader-friendly manner.

Abstract: A data element of a linked data structure is atomically moved without delaying lockless readers. A status-indicating entity is allocated, associated with the data element, and indicates validity of the data element with respect to the first linked data structure. A copy element, or a pointer thereto, is created from the data element. The status-indicating entity is associated with the copy element and indicates no validity of the copy element with respect to a second linked data structure. The copy element is linked to the second linked data structure. The status-indicating entity is atomically updated to indicate no validity of the data element with respect to the first linked data structure and validity of the copy element with respect to the second linked data structure. The data element is deleted and the status-indicating entity is disassociated from the copy element. Both structures may be deallocated in a deferred reader-friendly manner.

Abstract: Described are methods, systems and computer readable media for performance logging of complex query operations.

Abstract: A method, system, and computer program product for computer-aided deployment of mobile system apps for accessing enterprise applications. A form field service request originates from a non-native system. The service request comprises at least one form field identifier. The native computer system processes the service request using the form field identifier to identify corresponding forms stored at locations accessible to the native system (e.g., in a database engine). The native computer system processes the service request to map the form field to business logic operations and/or to other actions before delivering the service request to a native application that is configured to process the form field using native business logic. The business logic within the native application produces results from the native application which in turn are sent from the native application to the non-native system. The non-native system comprises any number of mobile devices, smart phones, and/or tablet devices.

Abstract: Provided are a data clustering apparatus and method, which can rapidly and accurately cluster data. The data clustering apparatus includes an index discriminating unit discriminating an index corresponding to an input position of new data input to a space for data clustering, including a lattice-type segmented space having lattice unit spaces set with different indexes, and a clustering unit creating a new cluster in the discriminated index using the input new data as a representative value when a cluster is not created at the discriminated index.

Abstract: Identifying influencers in a computer network by adjusting influence weights of corresponding participants of a computer network, where the influence weights relate to a topic, where each of the influence weights is adjusted in accordance with a predefined adjustment function, and where the predefined adjustment function uses a) the influence weight of any of the participants that disseminated content via the computer network, where the content relates to the participant whose influence weight is being adjusted, b) a participant topic similarity value of any of the participants that disseminated the content, where the participant topic similarity value relates to the topic, and c) a relationship topic similarity value of any relationship between the participants that disseminated the content and the participant whose influence weight is being adjusted, where the relationship topic similarity value relates to the topic, and then ranking the participants by their influence weights.

Abstract: A technique relates to flash-optimized data layout of a dataset for queries. Selection columns are stored in flash memory according to a selection optimized layout, where the selection optimized layout is configured to optimize predicate matching and data skipping. The selection optimized layout, for each selection column, is formed by storing a selection column dictionary filled with unique data values in a given selection column, where the unique data values are stored in sorted order in the selection column dictionary. Row position designations are stored corresponding to each row position that the unique data values are present within the given selection column, without duplicating storage of any of the unique data values that occur more than once in the given selection column.

Abstract: Applying a change statement to target databases includes creating a central change identifier and associating the central change identifier and change statement to respective target databases, including creating an association identifier for each respective target database. The central change identifier, the change statement and a respective association identifier are provided for sending to each respective target database. A change status is presented, which indicates occurrence of a current processing event by a respective target database, including showing the change status associated with the central change identifier and the respective target database in response to receiving the change status, the central change identifier and a change statement indicator from the respective target database.

Abstract: A pattern extraction apparatus for extracting a pattern of event occurrence from event time-series data generates an adjacent event graph by fetching adjacent events from the event time-series data, representing each of the adjacent events as a node, connecting the nodes by a directed link having a transition direction between the adjacent events and a weight, representing identical events as a single node, and, if there are a plurality of directed links between identical adjacent events, accumulating weights of the directed links into a single directed link. The pattern extraction apparatus cuts a directed link having an evaluation value smaller than or equal to a predetermined value in the generated adjacent event graph, the expected value being obtained based on the weight of the directed link.

Abstract: According to some embodiments, it may be determined that a plurality of hybrid database version upgrade migrations are to be performed. Each upgrade migration may include, for example, a schema change portion and a data change portion. A first database migration tool instance may be automatically run to perform the upgrade migration schema change portions. Similarly, a second database migration tool instance may be automatically run to perform the upgrade migration data change portions, wherein the second instance is not run until the first instance is complete.

Abstract: A method, computer program product and system for building a data model. In response to receiving a plurality of data field(s) as input, a database associated with each of the data fields(s) received is identified. A schema underlying the associated database is ascertained. One or more element(s) for each of the plurality of data fields(s) is identified based on applying the ascertained schema of the associated database(s). A data model is generated utilizing the identified one or more element(s) corresponding to each of the plurality of data field(s) associated to each of the database(s).

Abstract: Techniques for processing queries are provided. In one approach, an execution plan for a query includes multiple sub-plans, one or more of which are selected at runtime while one or more other sub-plans are not executed during execution of the execution plan. In another approach, data about misestimate is generated and stored persistently for subsequent queries. In another approach, statistics for a database object are generated automatically and efficiently while the database object is created or data items are added thereto. In another approach, a hybrid histogram is created that includes a feature of frequency histograms and a feature of height-balanced histograms. In another approach, computer jobs are executed in such a way to avoid deadlock. In another approach, changes to a database object trigger a hard parse of a query even though an execution plan already exists for the query.

Abstract: A technique for cloud infrastructure backup in a virtualized environment utilizing shared storage includes obtaining a workload input/output (I/O) profile to the shared storage over a time period. An attempt to locate one or more time windows in the workload I/O profile for which a cloud infrastructure backup can be staged is initiated. In response to determining the cloud infrastructure backup can be staged during at least one of the time windows, staging of the cloud infrastructure backup is scheduled during a selected one of the time windows. In response to determining the cloud infrastructure backup cannot be staged during at least one of the time windows, an interference tolerance approach is employed for accessing the shared storage for active workloads and the cloud infrastructure backup during the staging of the cloud infrastructure backup.

Abstract: A technique for cloud infrastructure backup in a virtualized environment utilizing shared storage includes obtaining a workload input/output (I/O) profile to the shared storage over a time period. An attempt to locate one or more time windows in the workload I/O profile for which a cloud infrastructure backup can be staged is initiated. In response to determining the cloud infrastructure backup can be staged during at least one of the time windows, staging of the cloud infrastructure backup is scheduled during a selected one of the time windows. In response to determining the cloud infrastructure backup cannot be staged during at least one of the time windows, an interference tolerance approach is employed for accessing the shared storage for active workloads and the cloud infrastructure backup during the staging of the cloud infrastructure backup.