Abstract: Performing a join of first and second database tables for a query includes applying a predicate of the query to the first table as a first predicate and determining how many distinct join key values the first table has that survive the applying of the first predicate, wherein a join key value of the first table that survives the applying of the first predicate is a surviving join key value for a second predicate. A selection includes selecting among applying the second predicate to the second table, probing the second table with the second predicate, and neither applying the second predicate to the second table nor probing the second table with the second predicate, wherein the selecting is responsive to the number of distinct, surviving join key values.

Abstract: Performing a join of first and second database tables for a query includes applying a predicate of the query to the first table as a first predicate and determining how many distinct join key values the first table has that survive the applying of the first predicate, wherein a join key value of the first table that survives the applying of the first predicate is a surviving join key value for a second predicate. A selection includes selecting among applying the second predicate to the second table, probing the second table with the second predicate, and neither applying the second predicate to the second table nor probing the second table with the second predicate, wherein the selecting is responsive to the number of distinct, surviving join key values.

Abstract: According to certain aspects, a method can include, at a first time, performing an incremental backup of first data associated with a virtual machine (VM) residing on a source client computing device from the source client computing device to one or more secondary storage devices to create a backup copy of the VM, where the VM is associated with a hypervisor of a first type; receiving an instruction to restore the first data associated with the VM from the one or more secondary storage devices; retrieving the first data from the one or more secondary storage devices; and applying the first data to second data associated with a replicated VM running on the destination client computing device, where the replicated VM is a replicated version of the VM, and where the second data corresponds to data of the VM at a time before the first time.

Abstract: The invention provides an apparatus, a method, a computer program product and an electronic device where, in accordance with the method there includes steps of implementing a search mediator function that is interposed between a plurality of applications and a plurality of search functions; and operating the search mediator function for receiving search queries from individual ones of the plurality of applications, forwarding received search queries to appropriate ones of the plurality of search functions, and providing search results to respective ones of the plurality of applications in accordance with at least application-specific search profiles.

Abstract: A method is provided for enabling a software user to obtain answers based on information retrieved from Big Data systems to complex questions, which comprises the steps of: providing a plurality of queries associated with different query families, the different query families comprise at least one family of simple queries and at least one query family of complex query family, and each of the families is associated with the following characterizing elements: information sources, entity type for which one or more features would be synthesized, attributes to be used as filters and attributes for calculating the new features; retrieving data from the respective information sources; processing the retrieved data to enable evaluating results of the queries associated with the at least one simple query families; calculating solutions to all queries and synthesizing features characterizing the answers, based on the calculated solutions.

Abstract: Embodiments store transaction metadata in dedicated pools of allocated memory chunks. Portions of the pools of allocated memory chunks are dedicated to the respective apply slave processes that mine and process change records. Also, the pools of allocated memory chunks are anchored within the structure of a transaction log such that buffering and application of metadata for one transaction does not block required buffering and application of metadata for other transactions. The standby database system pre-processes transaction metadata in preparation for application of the metadata to invalidate appropriate portions of MF data. Further, embodiments divide the work of pre-processing invalidation records among the many apply slave processes that record the invalidation records. A garbage collection selects memory chunks for garbage collection in reverse order of how the chunks were allocated.

Abstract: Embodiments disclosed herein provide a system and method for analyzing an identity hub. Particularly, a user can connect to the identity hub, load an initial set of data records, create and/or edit an identity hub configuration locally, analyze and/or validate the configuration via a set of analysis tools, including an entity analysis tool, a data analysis tool, a bucket analysis tool, and a linkage analysis tool, and remotely deploy the validated configuration to an identity hub instance. In some embodiments, through a graphical user interface, these analysis tools enable the user to analyze and modify the configuration of the identity hub in real time while the identity hub is operating to ensure data quality and enhance system performance.

Abstract: A database system may determine that a database is unavailable to generate an identifier for an event or that events may not be written to the database. As a result, the database system may write the event to a low-latency, supplementary file system. The database system may determine that the database is available at a later time, and read the event from the supplementary file system, store the event in a memory component, and then delete the event from the supplementary file system. The database system may then access the database to generate an identifier for the event, write the event to the database, and then delete the event from the memory component.

Abstract: A method begins by a dispersed storage (DS) processing module storing a data portion in a dispersed storage network (DSN), where the data portion is associated with a set of data index keys, a version index key, and with a set of portion index keys. The method continues with the DS processing module traversing, based on the set of data index keys, a plurality of index structures to determine whether an object retrieval structure exists for the data portion. When the object retrieval structure exists, the method continues with the DS processing module updating the object retrieval structure by determining whether a version record exists that corresponds to the version index key and when the version record exists, creating, within the version record, a new data portion record for the data portion to include an identifier of the data portion and the set of portion index keys.

Abstract: Mechanisms for disassembling and reassembling a tar archive are disclosed. A computing device accesses a tar archive comprising a file payload data segment and a plurality of non-payload data segments. The non-payload data segments in the tar archive are identified. The non-payload data segments are stored in a replay log structure. The file payload data segment of a file is identified in the tar archive, and file identification data identifying the file is stored in the replay log structure. The file payload data segment is not stored in the replay log structure.

Abstract: In one respect, there is provided a distributed database system. The distributed database system can include a plurality of nodes and a plurality of optimizers. A first optimizer of the plurality of optimizers can be configured to: receive, from a client, a command; generate, based at least in part on global metadata cached by the first optimizer, an execution plan for fulfilling the command that includes one or more tasks to be performed by at least a first node of the plurality of nodes; determine that at least one task of the one or more tasks are not successfully performed by the first node; and in response to determining that at least one task of the one or more tasks are not successfully performed by the first node, updating the cached global metadata at the first optimizer.

Abstract: A plurality of functions to configure a unit of a storage volume is maintained, wherein each of the plurality of functions, in response to being applied to the unit of the storage volume, configures the unit of the storage volume differently. Statistics are computed on growth rate of data and access characteristics of the data stored in the unit of the storage volume. A determination is made as to which of the plurality of functions to apply to the unit of the storage volume, based on the computed statistics.

Abstract: A plurality of functions to configure a unit of a storage volume is maintained, wherein each of the plurality of functions, in response to being applied to the unit of the storage volume, configures the unit of the storage volume differently. Statistics are computed on growth rate of data and access characteristics of the data stored in the unit of the storage volume. A determination is made as to which of the plurality of functions to apply to the unit of the storage volume, based on the computed statistics.

Abstract: Mechanisms for displaying an ordered sequence of images are provided. The mechanisms receive a search query as input from a user. The search query includes a start point and an end point of a virtual tour. The start point and the end point determine a boundary of the virtual tour. Based on the search query, images that are within the boundary of the virtual tour defined in the search query are collected. At least a subset of the collected images are displayed in an ordered sequence in accordance with the boundary of the virtual tour.

Abstract: A system receives a source and a metadata layer that describes the source. The source may comprise source records with fields containing source data, and the metadata layer may include metadata comprising at least one of a field data type, a field data length, a field description, or a record length. The processor may further validate the metadata layer against the source and write results to a log. The processor may further be configured for transforming the source records into transformed records for a load ready file. The processor may further balance a number of records in the source against a number of transformed records in the load ready file to generate a transformation failure rate.

Abstract: A method, apparatus and program product that determine a density of a key value referenced in a database query over at least one range of rows, and utilize the determined density to optimize the database query. By doing so, the density of various key values may be determined and compared, and a bit map may be generated over the range of rows of the key value that is denser, resulting in a reduction of resources to build and use the bit map. Moreover, from the bit map over the range of rows to be selected after using the determined density, dense regions may be identified that can be used to optimize block I/O's according to the number of rows to be selected based on the query.

Abstract: A method includes hierarchically identifying occurrences of some of the words in the set of sentences; creating a first index for each of some of the words based on the upper hierarchy of occurrences identified for each word; receiving input of a queried word; hierarchically identifying occurrences of the queried word in the set of sentences; creating a second index based on the upper hierarchy of occurrences identified for the queried word; comparing the first index and the second index to calculate an estimated value for the number of occurrences of a word in the neighborhood of the queried word; and calculating the actual value of the number of occurrences of a word in the neighborhood of the queried word based on an upper hierarchy and lower hierarchy of the occurrences on condition that the estimated value is equal to or greater than a predetermined number.

Abstract: Systems, software, and computer implemented methods can be used to present stylized text snippets with search results received from a search query. A search query is received and at least one web-addressable document responsive to the search query is identified. At least a portion of the text associated with the at least one responsive document and including at least a portion of the search term is retrieved. Further, style information associated with the retrieved portion of text is also retrieved. The style information is then applied to the associated portion of text to create a stylized portion of text associated with the at least one responsive document. A set of search query results including a listing of responsive documents and, for at least one of those documents, a stylized portion of text, is presented.

Abstract: Arrangements and methods provide item data information to one or more merchants. A Web server includes various modules that interact with customer item search queries and item data to create a set of attributes that is sent to a merchant as part of an item data form. The set of attributes included on the form is designed to aid in describing and identifying various items that a merchant may offer or currently offer for purchase on an e-commerce service provider. The set of attributes may also be used to augment or generate an item attribute index usable in conjunction with a service provider searching mechanism related to items offered for sale.

Abstract: A dynamic shared-memory data race detection tool with data-scoping capabilities to reduce runtime overheads is disclosed. The tool allows users to restrict analysis of memory locations to heap and/or stack variables that are of interest to them using explicit calls to functions provided in a library that is part of the race detection tool. The application code is instrumented to insert probes at all memory instructions and linked with the data race detection library to perform data-scoped race detection.