Abstract: In one embodiment of the present invention, one or more computer processors create update commands that describe a state change of a resource and include the update commands in a change event for the resource in a change log. Embodiments of the present invention can obviate the need for an indexer to retrieve all triples of a changed resource via HTTP GET requests, and obviate the need for the indexer to replace all triples of a prior version of a changed resource with newly obtained triples.

Abstract: A database processing system can support applications of an online transaction processing (OLTP) archetype and of an online analytical processing (OLAP) archetype. Hybrid archetypes can also be supported to implement hybrid scenarios. Requests for services are routed to an appropriate engine for fulfillment. User interface assets can be served by a shared infrastructure. Seamless navigation from one archetype to another can be supported in an insight-to-action scenario.

Abstract: Method for providing image information to a client device comprising: Receiving a search query from the client device. Effecting a search in respect of the search query. Sending to the client device search results including a group of images and another image, the group of images being selected from a plurality of groups of images stored on a server prior to having received the search query. Sending instructions to cause a display of a search engine results page (SERP) including the other image and a visual representation of the group of images. The visual representation of the group of images and the other image being displayed in an array. The visual representation of the group of images being visually distinguishable from the other image. The visual representation of the group of images including at least one image of the group of images.

Abstract: A method for filtering scanned objects displayed on a reader is provided. The reader may scan one or more transponders, and obtain, from a database, an image for each scanned transponder. Each transponder may be associated with an object (e.g., an item of retail inventory). The obtained image for each object may be presented on an interface, and a selection of an object category may be received using the obtained images. A determination may be made as to which objects are associated with the selected object category. A display screen may display data associated with only the objects associated with the selected object category.

Abstract: Creating for a resource a representation including properties of the resource. Determining and analyzing defined naming rules for a configuration database, each naming rule including a naming rule identification, a priority and at least one attribute having an attribute name. For each naming rule applicable to the resource, extracting at least one attribute value for each attribute name from the resource representation. For each naming rule applicable to the resource, creating a complex identity object containing a naming rule identification and a list of attribute names and attribute values. For each created complex identity object, set an authority flag if a given provider is able to obtain a complete set of values for the attributes. Processing through each complex identity object according to priority of the corresponding naming rule. Generating an alias for each result of a Cartesian product of each attribute value of the list of attribute names.

Abstract: Enterprises express the concepts of their electronic business-to-business (B2B) communication in diffrently structured ontology-like schemas. Collaborations benefit from merging the common concepts into semantically unique Business Entities (BEs) in a merged schema. Methods and systems for labeling the merged schema with descriptive, yet short and unique names, are described. A heuristically ranked list of descriptive candidate phrases for each BE is derived locally from the names and descriptions of the underlying concepts. A semantically unique candidate phrase is assigned to each BE that discriminates it from the other BEs by employing a constraint satisfaction problem solver.

Abstract: A non-transitory computer-readable recording medium contains an event processing control program for event processing that processes received event data in accordance with processing rules and outputs output data. The program causes a computer to execute a process that includes obtaining first assessment values pertaining to output data by the event processing for a first type of events, periodically by a first period. A correlation coefficient value of first and second received event data is periodically calculated by a second period longer than the first period. The first and second received event data are received event data of the first type and of a second type different from the first type, respectively. A second filtering condition pertaining to the second received event data is set based on the correlation coefficient value and a first filtering condition that pertains to the first received data and is specified from the assessment values.

Abstract: A data object is received from a host and stored on a storage compute device. A first mathematical operation is performed on the data object via the storage compute device. An update from the host is received and stored on the storage compute device. The update data is stored separately from the data object and includes a portion of the data object that has subsequently changed. A second mathematical operation is performed on a changed version of the data object using the update data.

Abstract: A method of searching shared files stored on a shared storage includes providing a search functionality in the shared storage having a set of search indexes to perform a search based on a search term; providing an event stream of update events associated with the shared files in the shared storage; processing the event stream to generate a processed event stream; and responding to update events in the processed event stream by indexing files referenced in the update events in the processed event stream where the indexing is performed to maintain a predetermined level of quality of service at the shared storage.

Abstract: Methods for faceted searching within clustered in-memory databases are disclosed. Faceted searching may be used to generate search suggestions. The faceted search engine may be able to use non-literal key algorithms for a partial prefix fuzzy matching and may include a feature disambiguation module. The disclosed search engine may be capable of processing large amounts of unstructured data in real time to generate search suggestions.

Abstract: A hardware accelerator for handling red-black trees, each node of a tree including a binary color indicator, a key and the addresses of a parent node and two children nodes, the accelerator including at least two registers termed node registers, capable of storing the set of data fields of two nodes of a tree; and logic units configured for receiving from a processor at least one input data item selected from an address of a tree node and a reference key, as well as at least one instruction to be executed; for executing the instruction by combining elementary instructions on the data stored in the node registers and for supplying to the processor at least one output data item including an address of a node. A processor and computer system including such a hardware accelerator is provided.

Abstract: A distributed indexing system spreads out the load on an index of stored data in a data storage system. Rather than maintain a single index, the distributed indexing system maintains an index in each media agent of a federated data storage system and a master index that points to the index in each media agent. In some embodiments, the distributed indexing system includes an index server (or group of servers) that handles indexing requests and forwards the requests to the appropriate distributed systems. Thus, the distributed indexing system, among other things, increases the availability and fault tolerance of a data storage index.

Abstract: A system for facilitating content creation includes collecting profiles which are analyzed to build a profile parameter index. A dummy profile is created based on the profile parameter index. The dummy profile is a fictitious character having profile parameters based on input from a user of the profile parameter index. The control of the dummy profile is under the user.

Abstract: The present invention relates to the field of computer communications technologies and discloses an information retrieval method and apparatus. In this solution, even if result information does not include a retrieval keyword, a matching value between the result information and each local matching model can be determined in a local matching model set according to a retrieval keyword group and a result keyword group that is determined according to a result information group. Then, a relevance degree is obtained according to the matching value between the result information and all local matching models. Therefore, the result information that has relatively high relevance with the retrieval instruction but does not include the retrieval keyword can still be presented to a user, which improves retrieval accuracy.

Abstract: As part of an upgrade procedure transitioning from a source system to a target system, table entries used by both the source system and the target system can be selectively locked on a row-by-row basis using a lock table and one or more select triggers. Related apparatus, systems, techniques and articles are also described.

Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for hardware acceleration are presented. A plurality of computational nodes for processing data is provided, each node performing a corresponding operation for data received at that node, A metric module is used to determine a compression benefit metric pertaining to performance of the corresponding operations of one or more computational nodes with recompressed data, An accelerator module recompresses data for processing by the one or more computational nodes based on the compression benefit metric indicating a benefit gained by using the recompressed data. A distribution function may be used to distribute data among a plurality of nodes.

Abstract: A data entry control is displayed at a client system, with user input mechanisms that allow a user to enter either unstructured data, or structured data. When the user enters information, a pre-segmentation validation is performed on the client system and the displayed data entry control is updated based on pre-segmentation results. When a server call is made to perform a server-side segmentation, the segmentation results received from the server are merged into the segmentation results on the client system.

Abstract: A data unification device for unifying data objects includes a retrieving entity, a first providing entity, a second providing entity, and an assembling entity. The retrieving entity is configured to retrieve unstructured data objects from a number of unstructured knowledge bases and structured data objects from a number of structured knowledge bases. The first providing entity is configured to provide a number of syntactic frames for each retrieved data object, wherein each syntactic frame include a syntactic concept, a syntactic concept-instance, and a syntactic concept-instance relationship. The second providing entity is configured to provide a number of semantic frames for each retrieved data object, wherein each semantic frame includes a semantic concept, a semantic concept-instance, and a semantic concept-instance relationship. The assembling entity is configured to assemble, for each retrieved data object, the provided syntactic frames and the provided semantic frames to one semantic object.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for validating analytics results. One of the methods includes processing a subset of a dataset and polling an analytics system for a corresponding output subset and comparing the two subsets to validate the analytics system.

Abstract: A zero downtime upgrade procedure upgrading a source system to a target system is initiated that prepares software for the target system in parallel to the operation of the source system. As part of the upgrade procedure, source tables of the source system are renamed. Thereafter, the renamed source tables are cloned for the target system. Further, the renamed source tables are equipped with database triggers to transfer data from the renamed source tables to the cloned tables used by the source system according to a source database schema. Next, the target tables are generated that include updated software content for later use by the target system while the source tables are used via a bridge database schema. Tables can then be shared between the source database schema accessed via the bridge database schema and the target system.

Abstract: Mechanisms are provided for managing a corpus of content. A question is processed by a Question Answering (QA) system to generate an answer to the question and a supporting evidence passage. A corpus value metric is calculated for the supporting evidence passage based on a determined number of times the supporting evidence passage is used to generate a high ranking answer to questions submitted to the QA system. A first corpus management operation is performed on the supporting evidence passage in response to determining that the corpus value metric meets or exceeds a first threshold, the first corpus management operation increasing a relative importance of the supporting evidence passage within the corpus. A second corpus management operation on the supporting evidence passage is performed in response to determining that the corpus value metric meets or falls below a second threshold, the second corpus management operation decreasing the passage's relative importance.

Abstract: The invention relates to systems and methods using a logical data model for aggregating data entities in a functional information system supported upon a computing platform, and also for providing systems and methods for analyzing economic information using a functional coordinate system.

Abstract: Data within a database object are accessed based on a query with a predicate including a plurality of conditional expressions. Elements of the database object are stored among a plurality of different storage regions along with range values for element values within each storage region. Each conditional expression of the query predicate is applied to the range values for each storage region to produce evaluation results of that conditional expression for each storage region. The evaluation result of each conditional expression for a corresponding storage region is combined to produce aggregated results for each of the storage regions, where the aggregated result for a corresponding storage region indicates results of a tri-state evaluation (e.g., true/false or unknown) of the conditional expressions for that storage region. One or more corresponding individual storage regions are scanned based on the aggregated results for those storage regions when the tri-state evaluation is unknown.

Abstract: A computer-implemented method for partitioning data for a query operation of one table of the database system is provided. The computer-implemented method comprises estimating a value distribution of the attribute in the result table based on a first value distribution of the attribute in the first column of the first table. The computer-implemented method further comprises determining boundaries for partitioning ranges of the attribute, based on the estimated value distribution, wherein the partitioning ranges correspond to a same number of rows of the result table. The computer-implemented method further comprises partitioning the first table with processing nodes of the query operation, based on the determined boundaries of partitioning ranges.

Abstract: Examples of dynamic database query efficiency improvement are provided herein. Query portions of a received database query can be identified as candidates for replacement. The candidates for replacement can be query portions that reduce the efficiency of the query. Alternative queries can be determined that include substitute query portion(s) in place of candidate(s) for replacement. An expected performance of the alternative queries can be determined. Based at least in part on the expected performance of the alternative queries, one or more alternative queries can be selected as replacement database queries for the received database query.

Abstract: Embodiments implement a plug-in architecture supporting adding new data sources to a federated database without the need to recode a federated database manager software module. The federated database manager software module includes a plug-in framework for interfacing with a data source cartridge. The data source cartridge supplies metadata including a feature table of a newly added data source to the framework and creates a physical query for the newly added data source based on an execution plan generated by the federated database manager software module. The data source cartridge returns the result set of the query of the new added data source to the federated database manager software module.

Abstract: A hardware accelerator 2 for performing queries into, for example, an indexed text log files is formed of plurality of hardware execution units (text engines) 4, each executing a partial query program upon the same full set of input data. These partial query programs may switch between different query algorithms on up to a per-character basis. The sequence of data when loaded into a buffer memory 16 for querying may be searched for delimiters as the data is loaded. The hardware execution units may support a number match program instruction which serves to identify a numeric variable, and to determine a value of that numeric variable located at a variable position within a sequence of characters being queried.

Abstract: Data within a database object are accessed based on a query with a predicate including a plurality of conditional expressions. Elements of the database object are stored among a plurality of different storage regions along with range values for element values within each storage region. Each conditional expression of the query predicate is applied to the range values for each storage region to produce evaluation results of that conditional expression for each storage region. The evaluation result of each conditional expression for a corresponding storage region is combined to produce aggregated results for each of the storage regions, where the aggregated result for a corresponding storage region indicates results of a tri-state evaluation (e.g., true/false or unknown) of the conditional expressions for that storage region. One or more corresponding individual storage regions are scanned based on the aggregated results for those storage regions when the tri-state evaluation is unknown.

Abstract: A method implemented on a computer for searching databases includes the computer receiving a search query for a database, the database including database fields; and dynamically providing and displaying a list of a plurality of the database fields. The list includes a descriptor indicating a data category of each database field. The computer also dynamically determines a quantity of entries in each database field. For each database field, the computer dynamically sets a limit based on a capacity to display the quantity of entries and for each database field having the quantity of entries exceeding the limit, the computer truncates data by adjusting a size of the quantity of entries until a displayable quantity of entries is achieved. The computer then displays the truncated data.

Abstract: A computer-implemented method for partitioning data for a query operation of one table of the database system is provided. The computer-implemented method comprises estimating a value distribution of the attribute in the result table based on a first value distribution of the attribute in the first column of the first table. The computer-implemented method further comprises determining boundaries for partitioning ranges of the attribute, based on the estimated value distribution, wherein the partitioning ranges correspond to a same number of rows of the result table. The computer-implemented method further comprises partitioning the first table with processing nodes of the query operation, based on the determined boundaries of partitioning ranges.

Abstract: Systems and methods for evaluating analytic queries comprising disjunctive Boolean expressions are described. A method may include receiving an analytic query comprising a first disjunctive Boolean expression. The method may further include transforming the analytic query to obtain a transformed analytic query comprising at least one nondisjunctive Boolean expression and at least a second disjunctive Boolean expression. The method may also include evaluating the transformed analytic query, wherein complete evaluation of the at least one nondisjunctive Boolean expressions and the at least a second disjunctive Boolean expressions yields the same results as evaluation of the first disjunctive Boolean expression.

Abstract: A stream based storage system includes a plurality of storage nodes configured to provide storage and retrieval of at least a time-based portion of one or more data streams in response to a receipt of a data storage/retrieval request associated with the one or more data streams. Each of the one or more data streams includes a plurality of time-ordered items. The stream based storage system further includes a plurality of applications communicatively coupled to the plurality of storage nodes. The plurality of applications is configured to issue the data storage/retrieval request associated with the one or more data items.

Abstract: Mechanisms for performing a duration-based operation are provided. At least one document is received having a plurality of associated dates and/or times and concepts associated with the dates and/or times. The at least one document does not explicitly specify a duration between the dates and/or times. Dates and/or times in the at least one document having similar associated concepts are correlated and, for the correlated dates and/or times, an implicit duration is calculated based on the dates and/or times. The concepts are associated with the implicit duration and a first document in the at least one document is annotated with an implicit duration annotation that specifies the implicit duration and the associated concepts. A duration based operation is then performed based on the implicit duration annotation.

Abstract: Concepts and technologies are disclosed herein for generating and using temporal metadata partitions. Metadata can be stored in temporal metadata partitions based upon a time range included in the metadata. Furthermore, metadata can be stored in multiple temporal metadata partitions to which the metadata is relevant. As such, metadata can be stored in manner that allows event data to be understood in the context of temporally accurate and/or relevant metadata. Functionality for executing queries of event data and providing results in view of metadata, as well as the merging of multiple temporal metadata partitions also are disclosed.

Abstract: The invention concerns a device for multimedia data retrieval. The multimedia data is associated with an active component. The device for multimedia retrieval being characterized in that, depending on an external event, some of the active components trigger an action that make the user aware of the multimedia data associated with said active components.

Abstract: A social graph is built which includes interactions, sharing activity, and connections between the users of the open Web and can be used to improve ad targeting and content personalization. Sharing activity between two users will affect ads or content that both users will be presented while surfing the Web. This sharing activity includes sending of links, sending of videos, sending of files, cutting and pasting of content, sending text messages, and sending of e-mails. A technique can include a sender sending a first link to at least one recipient. When a first node representative of the sender in a social graph is not identified and after receiving the activity information, creating a second node to represent the sender in the social graph. The social graph can be updated based on a recency of the sharing activity.

Abstract: Techniques for producing a cross tabulation are described. The techniques involve issuing a plurality of queries to a database. The queries are for each of at least one sublevel of data for each of at least one dimension of data associated with records in the database. The queries provide sublists of sorted identifiers for each one of the queries. The technique determines occurrences of intersections of levels of one dimension with levels of another dimension of the data associated with records in the database by traversing the sublists to detect intersections of the dimensions.

Abstract: For displaying visited document data, code stores visited document data comprising a visited document address and a visited document description for each document visited. In addition, the code displays on the display one or more of a first visited document address and a first visited document description with a search result in response to a portion of the visited document address matching a portion of a search result address.

Abstract: A method of refreshing a materialized view includes creating a materialized view based on a first result of a database query executed against a set of tables stored in a database and discovering a set of child storage objects associated with a parent storage object. The method also includes inserting, based on discovering the set of child storage objects, an entry into one or more tables of the set of tables, the entry including a child storage object of the set of child storage objects. The method further includes delaying a refresh of the materialized view until after the entry is inserted into the set of tables and then refreshing the materialized view, which is based on a second result of the database query executed against the set of tables.

Abstract: In embodiments of event segment search drill down, a search system exposes a search interface that displays multiple events returned as a search result set. A segment can be emphasized in event raw data of an event that is one of multiple events displayed in the search interface, and a menu is displayed with search options that are selectable to operate on the emphasized segment. The menu includes the search options to add the emphasized segment as a keyword to a search command in a search bar of the search interface, exclude the keyword that represents the emphasized segment from a search, or create a new data search based on the highlighted segment. A selection of one of the search options in the menu can be received, and the search command in the search bar is updated based on the search option that is selected.

Abstract: In embodiments of statistics time chart interface cell mode drill down, a first interface displays in a table format that includes columns each having a column heading comprising a different value, each different value associated with a particular event field, and includes one or more rows, each row having a time increment and aggregated metrics that each represent a number of events having a field-value pair that matches the different value represented in one of the columns and within the time increment over which the aggregated metric is calculated. A cell can be emphasized that includes one of the aggregated metrics in a row that includes the respective time increment, and in response, a menu displays options to transition to a second interface.

Abstract: A method, an apparatus, and a computer program product for presenting a cooking schedule are provided. In the method, recipes are received, wherein each of the recipes includes cooking processes and cooking time required for finishing each of the cooking processes. The cooking processes are scheduled according to the cooking time of each of the cooking processes to make a total cooking time required for finishing all of the cooking processes in the recipes to be the shortest. Finally, the scheduled cooking processes are sequentially prompted.

Abstract: In one embodiment, a method comprises defining a set of concepts based on a first set of structured and unstructured data objects, defining a business rule based on the set of concepts, applying the business rule to a second set of structured and unstructured data objects to make a determination associated with that set, and outputting to a display information associated with the determination.

Abstract: A system, method and apparatus for providing real-time tracking of user personalized metrics from a database are provided. A request is received from a user device for personalized metrics data from a customer relationship management (CRM) application. A home page user interface is transmitted for display on the user device. The home page user interface provides several icons for user selection, where each of the several icons corresponds to a unique personal metrics category. A selection of one of the several icons is received. A user interface for a personal metrics category corresponding to the selected icon is transmitted for display on the user device. The user interface provides for display on the user device at least one personalized metrics data corresponding to the personal metrics category.

Abstract: A method for updating a storage element may include receiving a first set of data from a first device that operating in a structure. The first set of data corresponds to a first data type interpretable by the first device. The method may also include translating the first set of data into a second set of data of a second data type interpretable by a second device operating in the structure but not by the first device. The first set of data and the second set of data are associated with a first portion of information associated with occupancy properties of the structure. The method may then include storing the second set of data in a storage element that includes a second portion information associated with the occupancy properties of the structure.

Abstract: Disclosed herein is a data synchronization between a client computing device's local store and another data store, such as a data store that is remote to the client computing device. The other data store may comprise a cloud data store. The existence, or absence, of a causal relationship between the local and remote data stores for a given data item is used to determine whether or not a conflict exists and/or whether a requested operation may be performed. The causal relationship may be determined using a previous commit's hash value, referred to as a hash_base value, and a hash value, both of which are associated with the data item.

Abstract: Systems, methods, and apparatuses can provide staged migration from one or more user accounts from a source system to a destination system using an application local to the source systems. The automated staged data migration can provide coordinated staged data migration of large amounts of data in a single automated process. The system can provide automated and remotely controlled staged migrations of data that may perform source system type detection and work with multiple types of systems.

Abstract: Techniques are described for efficient execution of analytical queries on large amounts of data in a parallel database cluster while making maximal use of the available hardware.

Abstract: A method for map-reduce job virtualization is disclosed. The method includes receiving a map-reduce job written in a first map-reduce language. The map-reduce job is to be performed in parallel on a plurality of nodes of a plurality of clusters. The method also includes selecting one or more clusters to run the map-reduce job. The method further includes identifying a second map-reduce language associated with the selected clusters. The method also includes converting the first map-reduce language of the map-reduce job into the second map-reduce language. The method further causes the map-reduce job in the second map-reduce language to be run on the plurality of nodes of the selected clusters.

Abstract: A grouping apparatus acquires a plurality of messages output from a plurality of output source apparatuses, respectively. The grouping apparatus acquires a plurality of explanatory texts respectively relating to the plurality of messages, from documents respectively relating to the output source apparatuses. The grouping apparatus generates a plurality of message groups that include related messages respectively, based on the plurality of explanatory texts for the respective messages.