Abstract: Systems and methods are disclosed to run a multistore system by receiving by-products of query processing in the multistore system, wherein the by-products include views or materializations of intermediate data; placing the views or materializations across the stores based on recently observed queries as indicative of a future query workload; determining a benefit score for each view based on a predicted future query workload, wherein each store has an allotted view storage budget, and there is a view transfer budget for transferring views between the stores; and tuning a physical design of the multistore system.

Abstract: This invention relates generally to an interactive entertainment system that provides at least two discrete, independent stories that are interactively intertwined through a variety of online or other interactive media whereby the user of the interactive entertainment system can participate by commenting, by contributing materials (in visual, photographic, video, audio, tactile or other sensory and cognitive formats), by responding to quizzes and polls, and by otherwise interacting with other users of the interactive entertainment system, or with characters in any story, as if the latter were real persons.

Abstract: The present invention extends to methods, systems, and computer program products for formulating global statistics for parallel databases. In general, embodiments of the invention merge (combine) information in multiple compute node level histograms to create a global histogram for a table that is distributed across a number of compute nodes. Merging can include aligning histogram step boundaries across the compute node histograms. Merging can include aggregating histogram step-level information, such as, for example, equality rows and average range rows (or alternately equality rows, range rows, and distinct range rows), across the compute node histograms into a single global step. Merging can account for distinct values that do not appear at one or more compute nodes as well as distinct values that are counted at multiple compute nodes. A resulting global histogram can be coalesced to reduce the step count.

Abstract: Data synchronization includes establishing a plurality of target data tables based on a source data table in which data to be synchronized is stored, determining a current target data table from the plurality of target data tables, synchronizing the source data table and the current target data table, and directing an application server to access the current target data table upon successful completion of synchronization.

Abstract: A highly flexible and extensible structure is provided for physically storing tabular data. The structure, referred to as a compression unit, may be used to store tabular data that logically resides in any type of table-like structure. According to one embodiment, compression units are recursive. Thus, a compression unit may have a “parent” compression unit to which it belongs, and may have one or more “child” compression units that belong to it. In one embodiment, compression units include metadata that indicates how the tabular data is stored within them. The metadata for a compression unit may indicate, for example, whether the data is stored in row-major or column major-format, the order of the columns within the compression unit (which may differ from the logical order of the columns dictated by the definition of their logical container), a compression technique for the compression unit, the child compression units (if any), etc.

Abstract: One embodiment provides an information processing apparatus, including: a search module configured to perform a search on a plurality of pages with a designated search condition, the pages being managed by an application program capable of managing information by arranging at least one object in any desired layout on each page; and a display controller configured to display at least one object extracted through the search on a screen of a display module as a search result, with a layout of each object on the page kept unchanged.

Abstract: A method and apparatus for a data warehouse built on top of MapReduce is provided. A virtual view is defined on top of the common star or snowflake data warehouse schema. A SQL-like, but much more succinct, query language is provided to leverage the virtual view. Many advanced query processing features leveraging the virtual view are also provided. Further, several optimization techniques ranging from data compression and access method to multi-query optimization and exploiting materialized views are provided. Further, a technique to seamlessly integrate the data warehouse system into any ad-hoc MapReduce jobs is provided. Thus, fully leveraging the power of both MapReduce and data warehouse technologies is achieved.

Abstract: Described are techniques for providing notifications. A client registers a subscription request for a view to provide a notification to the client responsive to a data change affecting the view. The view is generated using one or more commands operating on data included in a database. A first operation is performed to the database. It is determined whether the first operation causes a data change affecting the view. Responsive to determining the first operation causes a data change affecting the view, a notification is sent to the client. The view is updated in response to receiving the notification.

Abstract: The subject mater herein relates to database management and, more particularly, to non-equijoin metadata. Various embodiments described herein provide systems, methods, software, and data structures to facilitate non-equijoins of data. Some such embodiments include a data store to hold metadata describing relationships between database tables. The relationships between database tables may include one or more non-equijoins of tables in the form of one or more table-column pairs of a first table being non-equal to one or more table-column pairs of a second table. In some embodiments, the metadata may be used by a query generator to build query statements including one or more non-equijoin.

Abstract: An index is created for a database by selecting at least one column of a database table as a basis to create the index, generating at least one index of a tree structure according to the at least one column, where a pointer stored in a leaf node of the at least one index is null. In an example embodiment, a value to a pointer is stored in a leaf node according to an intermediate result in response to the intermediate result being generated, where the pointer stored in the leaf node points to a data page storing the intermediate result. The created index can be reused and the intermediate result can be effectively used, such that the efficiency of database operation is improved.

Abstract: A query is received which causes an initial data flow graph that includes a plurality of nodes that are used to execute the query is generated. Thereafter, the initial data flow graph is optimized using a model optimizer that includes an optimizer framework and an application programming interface (API). The optimizer framework provides logic to restructure the initial data flow graph and a rules engine for executing one or more optimization rules. The API allows for registration of new optimization rules to be executed by the rules engine. Execution of the query is then initiated using the optimized data flow graph. Related apparatus, systems, techniques and articles are also described.

Abstract: An approach is provided to modifying structured query language (SQL) statements to more efficient forms. In the approach, an SQL statement is received and compared to a number of predefined malformation rules with at least one of the predefined malformation rules includes a syntactical pattern. If the comparison reveals that the received SQL statement includes a malformed expression that would be inefficiently processed by a database engine, the malformed expression is modified to an efficient SQL expression form and the efficient SQL expression form is executed by the database engine.

Abstract: Techniques are provided for selectively refreshing a materialized view. A portion of a materialized view is refreshed (or updated) while other portions of the materialized view are not refreshed. Thus, the other portions of the materialized view may contain “stale” data that does not accurately reflect current data in the base table(s) upon which the materialized view is based. In one technique, a user indicates the portion of the materialized view that is to be refreshed. In another technique, a user indicates a plurality of portions of a materialized view and it is automatically determined which portion should be refreshed first. Change data that indicates information about changes made to different portions of one or more base tables and/or read data that indicates information about reads to different portions of the materialized view may be taken into account to determine which portion of a materialized view to refresh.

Abstract: Techniques are provided for performing a refresh or update of a materialized view without modifying the materialized view. Such a refresh is referred to as an out-of-place materialized view refresh. An out-of-place materialized view refresh involves creating one or more outside tables into which data will be inserted. During the refresh, the materialized view may be accessible for query processing, even though the materialized view contains “stale” data. After the insertion, the one or more outside tables are made accessible for query processing and future queries will target the one or more outside tables instead of the materialized view.

Abstract: A query is received and an initial data flow graph comprising a plurality of nodes is generated for executing the query. The initial data flow graph is optimized using a model optimizer that accesses at least one of a plurality of patterns to identify a matching pattern and executes at least one optimization rule associated with a matching pattern. Execution of the query is then initiated using the optimized data flow graph. Related apparatus, systems, techniques and articles are also described.

Abstract: A method and system for providing keyword ranking using a common affix is provided. The method for providing keyword ranking using the common affix includes: extracting a common affix using a keyword set; and providing keyword ranking which includes the extracted common affix.

Abstract: Resolving an issue raised by at least one user includes establishing a contact session over a communication channel for servicing the issue. The Internet is searched for content related to providing a resolution for the issue using a customized query, when a search of a database does not return results. Content obtained from at least one Internet source as a result of searching the Internet using the customized query is restructured to prepare the resolution for the issue. The at least one Internet source from which the content was obtained is updated with the resolution.

Abstract: Database report generation technology for handling a single logical query that requires data that is physically located in two different sources. The system uses intelligent push-down joins, which move data from one source to the other and join data within that source. The system dynamically determines which direction to move data depending on how the data is used in a query.

Abstract: A system and methods for implementing a materialized view for a query are provided. The query system includes a database that includes a base table. The base table can include a set of data. The query system also includes a materialized view associated with a portion of the set of data, and a MVQR component to translate each of a range predicate of the materialized view and a range predicate of a query into a canonical range representation (CRR) format in materialized view metadata and query metadata, respectively, to enable the query to search the materialized view.

Abstract: A system and method for implementing incremental evaluation that is advantageous over nonincremental evaluation. The system and method incrementally maintain each individual aggregate value, for non-nested queries, using a constant amount of work.

Abstract: A query is received which causes an initial data flow graph that includes a plurality of nodes that are used to execute the query is generated. Thereafter, the initial data flow graph is optimized using a model optimizer that includes an optimizer framework and an application programming interface (API). The optimizer framework provides logic to restructure the initial data flow graph and a rules engine for executing one or more optimization rules. The API allows for registration of new optimization rules to be executed by the rules engine. Execution of the query is then initiated using the optimized data flow graph. Related apparatus, systems, techniques and articles are also described.

Abstract: In a method and an apparatus (1) for searching in a memory-efficient manner for at least one query data element in a graph (2A), only as many data elements are read into a memory as are required for their subsequent processing. Increased memory efficiency is ensured as a result of this. The proposed apparatus is particularly suitable for use in terminals having very limited memory, in particular in mobile terminals.

Abstract: A search query is received. Personal information for a user is then determined. A search is performed in a general subdomain of general content using the search query. For example, the general subdomain of general content may be a WWW search. Then, a vertical subdomain is determined based on the personal information. A search is then performed in the vertical subdomain of specialized content using the search query. The search performed in the general subdomain and the search performed in the vertical subdomain generate general search results and vertical search results. The results may be combined and outputted to a client.

Abstract: A database integration viewer that allows additional properties to be associated with a record as viewed in a single record or table, even though those additional properties are not owned by the record in the underlying source record or table in the database. Using this integration view, a viewed version of record or table may be different than the actual structure of the source record or table. In the viewed version of the record or table, the viewed record or table or may include some or all of the properties for the records of the subject record or table, while incorporating one or more additional properties for the record into the viewed table. The properties may be scalars, or may be computed to populate the viewed version of the record or table.

Abstract: A computer-implemented method for generating online search results includes receiving, over the Internet, referring URL data including a query, and a network site ID for a network site that was visited based on third party search engine analysis of the query; generating indexed query and network site data based on the received referring URL data and network site; receiving a new query from a user; determining a network site relevant to the new query based on the indexed query and network site data; and displaying to the user a link to the network site. Systems for generating online search results are also disclosed.

Abstract: A computer readable storage medium comprises executable instructions to generate a stream cube to store data received from multiple data sources. A plurality of multi-dimensional data streams are generated to represent the received data. A materialization strategy is repeatedly determined for the stream cube. The stream cube is materialized according to the materialization strategy to record the multi-dimensional data streams.

Abstract: Various aspects of this disclosure are directed to receiving, by a computing device, a first table join query that may include a first group of table identifiers that identify the two or more tables. The computing device may determine whether the first table join query includes an outer join command. When the first table join query includes the outer join command, the computing device may compare the first group of table identifiers and a second group of table identifiers of one or more pre-joined tables to determine whether each of the first table identifiers matches at least one of the second group of table identifiers. The computing device may further determine whether a predicate associated with each table identifier matches a predicate associated with a matching second table identifier. When each of the predicates match, the computing device may rewrite the first table join query.

Abstract: In one embodiment the present invention includes an OLAP execution model using relational operations. In one embodiment, the present invention includes, a method comprising receiving a first query in an online analytic processor (OLAP) executing on one or more computers, the OLAP generating and comprising a model specifying a graph defining a plurality of nodes and a plurality of tiers, each node corresponding to a different operation on data. A second query is generated by the OLAP. The second query includes a plurality of layered subqueries each corresponding to one of the nodes in the graph for specifying the different operations on data. The second query is received in a relational engine coupled to the datastore. The relational engine executes the second query, and in accordance therewith, retrieves data.

Abstract: A data parallel pipeline may specify multiple parallel data objects that contain multiple elements and multiple parallel operations that operate on the parallel data objects. Based on the data parallel pipeline, a dataflow graph of deferred parallel data objects and deferred parallel operations corresponding to the data parallel pipeline may be generated and one or more graph transformations may be applied to the dataflow graph to generate a revised dataflow graph that includes one or more of the deferred parallel data objects and deferred, combined parallel data operations. The deferred, combined parallel operations may be executed to produce materialized parallel data objects corresponding to the deferred parallel data objects.

Abstract: Techniques for generating a set of one or more materialized query table (MQT) candidates for a workload are provided. The techniques include receiving a workload, wherein the workload comprises a set of one or more queries, generating one or more best matching MQTs (BMQTs) based on one or more query blocks of the one or more queries by removing syntax that is not qualified for a MQT re-write, determining one or more frequently used multi-joins in the workload, using the one or more BMQTs and the one or more frequently used multi-joins to generate a set of one or more workload MQTs (WMQTs), and grouping one or more WMQTs and one or more BMQTs into one or more groups to merge into a set of a smaller number of MQTs and to cover the workload.

Abstract: This invention relates generally to an interactive entertainment system that provides at least two discrete, independent stories that are interactively intertwined through a variety of online or other interactive media whereby the user of the interactive entertainment system can participate by commenting, by contributing materials (in visual, photographic, video, audio, tactile or other sensory and cognitive formats), by responding to quizzes and polls, and by otherwise interacting with other users of the interactive entertainment system, or with characters in any story, as if the latter were real persons.

Abstract: Systems and methods for article location and retrieval are described. In one described method, the normal processing of an operating system call associated with a dialog control is interrupted, and a search dialog control is displayed. The search dialog control is associated with an index comprising a plurality of events. Each of the plurality of events may be associated with at least one of a plurality of client applications and at least some of the plurality of events can be captured in real time. Each event may be associated with one or more articles.

Abstract: Methods and systems for submitting media object queries and receiving suggested answers for the media object queries. In one aspect, a method includes receiving from a first user a first media object and a first query relating to content in the first media object, presenting the first media object and the first query to multiple second users, receiving a suggested answer to the first query from each of two or more second users of the multiple second users, where at least two of the suggested answers are distinct, ranking the suggested answers, and presenting one or more of the ranked suggested answers to the first user.

Abstract: A query is received which causes an initial data flow graph that includes a plurality of nodes that are used to execute the query is generated. Thereafter, the initial data flow graph is optimized using a model optimizer that includes an optimizer framework and an application programming interface (API). The optimizer framework provides logic to restructure the initial data flow graph and a rules engine for executing one or more optimization rules. The API allows for registration of new optimization rules to be executed by the rules engine. Execution of the query is then initiated using the optimized data flow graph. Related apparatus, systems, techniques and articles are also described.

Abstract: A computer-readable medium, computer-implemented method, and apparatus are provided. In one embodiment, one or more events are received, a new intermediate state of a data partition is created based on the event, and the new intermediate state is stored. The new intermediate state is reduced into a form suitable for aggregation, and an aggregate value is created by aggregating the new intermediate state with other intermediate states of other data partitions.

Abstract: A materialized XML view matching system and method for processing of SQLXML queries using view matching of materialized XML views. The view matching process of the embodiments of the system and method use a multi-path tree (MPT) data structure. Embodiments of the materialized XML view matching system and method construct an MPT data structure for each input query and view expression. View matching is performed on the MPT data structures to generate a set of partial matches, which then are cleaned to generate a set of candidate matches. A valid match definition is generated by testing each candidate match for different forms of compliance. Using the valid match definition, a set of valid matches is identified and extracted. For each valid match, a substitute query expression is constructed that can serve as a replacement for the original query. These substitute queries can be used to evaluate the original query.

Abstract: Generally described, the present disclosure is directed to an eventually consistent replicated data store that uses, for its underlying storage, a computer software library that provides a high-performance embedded database for data. The replicated data store employs a plurality of hosts interconnected to one another, allowing for writes to any host and full awareness of membership across all hosts. With the data replication framework disclosed herein, various modes are allowed to be built up on top of the core system.

Abstract: A computer implemented method, apparatus, and computer usable program code for providing data about an airport from an airport mapping database. A first set of elements are stored in the airport mapping database, wherein the first set of elements are visible objects and are identified using a set of geometric features. A second set of elements are stored in the airport mapping database, wherein the second set of elements are non-visible objects and are identified using the set of geometric features. A first element from the first set of elements is associated with a second element in the second set of elements based on an operational relationship between the first element and the second element. A responsive set of elements containing one element from the first set of elements and another element from the second set of elements based on associations between elements in the first set of elements and the second set of elements are returned in response to a query.

Abstract: A document preprocessor preprocess a document to enhance the statistical features of the document. The system preprocesses the document by matching a prefix and a trailing context in the document with one or more matching prefixes in a transformation database, where the prefix is a first string of one or more tokens in the first document and the trailing context is a second string of one or more tokens in the first document that trail the prefix. Alternatively, the system preprocesses the document by computing cyclic permutations of the document, sorting these permutations and taking the last token from each of the sorted permutations.

Abstract: Provided are techniques for creating one or more fine-grained access control rules that are associated with a base table. A materialized query table is created from the base table without applying the one or more fine-grained access control rules associated with the base table when obtaining data from the base table. A fine-grained access control protection indicator is turned on for the materialized query table. In response to receiving a direct access request to the materialized query table in a query referencing the materialized query table, access is provided to the data in the materialized query table by applying one or more fine-grained access control rules associated directly with the materialized query table to the data in the materialized query table before returning the data.

Abstract: Methods and apparatus define a user interface for a computer program after execution of the computer program has begun. A user interface for the program is defined by: associating a map component and a fashion component on the fly at run time to generate the user interface; and executing the user interface with the associated function and appearance.

Abstract: A method autonomically refreshes a materialized query table (MQT) in a computer database to improve database performance and utility. In preferred embodiments, the query optimizer autonomically initiates a refresh of MQT depending on an estimated time for the query to access the base tables. In other preferred embodiments, the query optimizer estimates the time for the query to access the base tables and compares it to the estimated time to refresh the MQT to determine whether to refresh the MQT and run the query over the MQT rather than the base tables.

Abstract: In an embodiment, estimated costs are used to pick the best refresh technique (e.g., method) for a given MV. In another embodiment, estimated costs are used to schedule the refresh of a set MVs in an order such that overall time to refresh is reduced, or in an order that uses the smallest overall time, for refreshing when compared to other alternative refresh schedules. In another embodiment, the estimated cost of refreshing each of a set of MVs is used to select the set of CPU resources to allocate to refreshing each MV. Based on the estimated costs, the allocation of CPU resources is chosen to be more optimal (e.g., use less CPU time) than other available sets of CPU resources. In an embodiment, when refreshing an MV, delayed index maintenance is chosen if a significant portion of the base table and/or the partitions of the table has changed.

Abstract: A method autonomically refreshes a materialized query table (MQT) in a computer database to improve database performance and utility. In preferred embodiments, the query optimizer autonomically initiates a refresh of MQT depending on an estimated time for the query to access the base tables. In other preferred embodiments, the query optimizer estimates the time for the query to access the base tables and compares it to the estimated time to refresh the MQT to determine whether to refresh the MQT and run the query over the MQT rather than the base tables.

Abstract: An apparatus and method autonomically refreshes a materialized query table (MQT) in a computer database to improve database performance and utility. In preferred embodiments, the query optimizer autonomically initiates a refresh of MQT depending on an estimated time for the query to access the base tables. In other preferred embodiments, the query optimizer estimates the time for the query to access the base tables and compares it to the estimated time to refresh the MQT to determine whether to refresh the MQT and run the query over the MQT rather than the base tables.

Abstract: A data consumer is provided with a system that enables automatic generation of a virtual database schema in order to support a customized pattern of data consumption across one or more source databases. In one embodiment, a metadata manager component is configured to facilitate creation of a first data tag and a second data tag. A schema definition manager component is configured to facilitate creation of a data entity that groups the first data tag with the second data tag. A virtual schema generation service component generates the virtual database schema by analyzing the data entity and, based on the grouping of the first data tag with the second data tag, automatically generating and storing a database query statement that, when executed, causes a retrieval of data consistent with data location indicators included in the first and second data tags.

Abstract: Database query analysis technology, in which an input query is received that relates to multiple attribute classes of data records. An index that is descriptive of the data records in data storage is accessed and relative positions in the accessed index for the multiple attribute classes are identified. The accessed index is processed based on more than one of the multiple attribute classes and the identified relative positions, and the processed index is used to identify groups of data records that are included in the data records in the data storage and that share common values for the multiple attribute classes in the input query. Metrics corresponding to the data records included in each of the identified groups of data records are accessed, computations are performed on the accessed metrics, and a report is generated that reflects results of the computations.

Abstract: Values that occur above a threshold frequency for certain characteristic(s) of a data set are identified. A limited number of count buckets are allocated based on the threshold. Buckets store proxy counts for identifying candidate sets of values rather than actual counts. The data set is divided and each portion is analyzed separately, by iterating through each item in that portion. During each iteration, depending on an item's value(s), a bucket is incremented, all buckets are decremented, or a bucket is assigned or reassigned to count different value(s). A candidate set of values and associated counts is selected for a portion based on the buckets. The candidate sets for each portion are merged and, in some embodiments, filtered based on the associated counts. Actual frequencies are then determined for the values that remain in the merged candidate set.

Abstract: An embodiment of the system and method for optimizing pattern query searches on a graph database uses a pattern query optimizer to optimize execution of the search plan for any sequence of SQL expressions by separating or breaking a pattern query into multiple subpattern queries before converting the subpattern queries into SQL expressions. An embodiment of the pattern query optimizer algorithmically, without intervention by an analyst, decomposes any pattern query into a set of subpattern queries by first identifying branches and cycles within a pattern query and then decomposing each identified branch and cycle into equivalent straight line paths, i.e., straight line nodes joined by edges. Cardinality may be used to improve the performance of pattern searches.

Abstract: In various example embodiments, a system and method for personalization of search results are provided. In example embodiments, a user interface that allows a user to establish optimization preferences used to personalize results based on a query is provided. The optimization preferences include values that are a portion of a total allowed value assigned to interrelated optimization factors. The optimization preferences are received via the user interface. The optimization preferences are applied to matches obtained based on the query to generate a personalized result set.