Abstract: The subject technology provides configurations for receiving a query for data stored across data systems in which the query is associated with a user. It is determined if the user has permission to execute an operation from the query at a data in which the operation is executed upon at least one table provided by the data system. The subject technology determines if the operation corresponds to a cache object in a cache registry if the user has permission. Each cache object is owned by a cache manager user. A view associated with the user is created that provides temporary access privileges to the cache object corresponding to the operation in which the cache object includes results of the operation executed in the query and the cache object is owned by the cache manager user. The results of the operation are then provided in the created view to the user.

Abstract: With respect to retrieving documents of interest using a search system, it is made possible to provide a document search system for retrieving documents of interest efficiently and intuitively. Along with a display of a list of search results, new query candidates as well as the hit counts returned with those queries are presented.

Abstract: A computer implemented method, computer program product, and data processing system for dynamically altering database views, based on a set of administrator-defined rules. The dynamic view system determines whether the query, requested by a user, has an associated view rule. The system determines if the view rule is satisfied. In response to a satisfied associated view rule, the altered view is returned to the user.

Abstract: A technique for optimizing execution of a query that accesses data stored on a data store connected to a computer. Statistics on one or more pre-defined queries are used to determine an optimal query execution plan for the query. In particular, improved cardinality estimates are generated for one or more query execution plans for the query using statistics of one or more pre-defined queries that vertically overlap the query. These cardinality estimates are used to make more accurate cost estimates, thus improving the likelihood of determining the optimal query execution plan.

Abstract: An efficient reasoning system and method using a view in a DBMS-based RDF triple store are provided. The DBMS-based reasoning system includes a triple input unit for receiving a Resource Description Framework (RDF) triple. A triple examination unit examines whether the received triple conforms to RDFS subsumption relation entailment rules or Web Ontology Language (OWL) inverse relation rules. A view creation unit creates a table view when the received triple conforms to the RDFS subsumption relation entailment rules or the OWL inverse relation rules as a result of the examination. A triple storage unit stores the received triple. The DBMS-based triple store can efficiently perform reasoning based on rule rdfs7 or rdfs9, which is included in the RDFS subsumption relation entailment rules, and the OWL inverse relation rules.

Abstract: The described implementations relate to updating views in a database system. One implementation can identify an active view that retrieves records from a database and determine one or more physical tables in the database that are referenced by the active view. The implementation can track one or more columns in the physical tables that are used by the active view and identify a change to the physical tables in a transaction log of the database. If the change does not affect the one or more columns, the change can be treated as an ignorable change for the active view.

Abstract: A method is illustrated as retrieving a plurality of search queries and defining relationships between search queries in the plurality of search queries based on semantic data associated with the search queries. A visual representation of the plurality of search queries may be generated and the visual representation may be partitioned into a plurality of tiles, each tile representing a predefined portion of the visual representation.

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 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: 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 jump destination site determination method and system determine a site which is a jump destination of a hyperlink selected in a terminal apparatus. The system and method include receiving a jump destination distribution ratio representing a ratio of jumping to each of a plurality of sites storing same contents, which varies over time, and contents including a hyperlink to which the jump destination distribution ratio is correlated, judging whether a time period elapsing from a time the contents are received until a time the hyperlink included in the contents is selected is equal to or longer than a predetermined time period, and acquiring a jump destination distribution ratio effective at a point in time at which the hyperlink is selected from the server responsive to determining that the time period elapsed is equal to or longer than the predetermined time period.

Abstract: In one embodiment, a method includes concurrently executing a set of multiple queries, through a processor, to improve a resource usage within a data warehouse system. The method also includes permitting a group of users of the data warehouse system to simultaneously run a set of queries. In addition, the method includes applying a high-concurrency query operator to continuously optimize a large number of concurrent queries for a set of highly concurrent dynamic workloads.

Abstract: A natural language query tool comprising cascaded conditional random fields (CRFs) (e.g., a linear-chain CRF and a skip-chain CRF applied sequentially) processes natural language input to produce output that can be used in database searches. For example, cascaded CRFs extract entities from natural language input that correspond to column names or column values in a database, and identify relationships between the extracted entities. A search engine can execute queries based on output from the cascaded CRFs over an inverted index of a database, which can be based on one or more materialized views of the database. Results can be sorted (e.g., according to relevance scores) and presented in a user interface.

Abstract: An apparatus is provided with base table storage sections that store base tables and delta tables for the base tables, a summary table storage section that stores a summary table for storing results of queries to a plurality of base tables and delta information about the summary table, delta data processing sections that insert delta data of the base tables into the delta tables, and a delta computation processing section that generates delta information about the summary table. The delta computation processing section is provided with a generation section that generates delta information about a specified base table on the basis of an update that has been performed for the base table, in a situation where a subsequent update of the specified base table is permitted; and a control section that performs control so that, when a different base table is specified, delta information is generated in a different transaction.

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: A dynamic data buffer method, includes providing a system for accessing a database having a plurality of fields of data potentially used by applications, analyzing an application's structure to identify at least one field of data from the plurality of fields of data in the database used by the application, performing a field-wise select for selecting only the identified at least one field of data and creating a dynamic data buffer for storing only the identified at least one field of data.

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 large OLAP cube includes data and dimensions not required for a particular query, or for a collection of queries. A response to a query is generated by using the large OLAP cube rather than using an OLAP cube tailored to the query, and rather than querying the relational database directly. The large OLAP cube may be created after identifying a set of frequently sought data and/or filters used in queries to the relational database. Data may be staged by creating a smaller OLAP cube with data extracted from the large OLAP cube. The cubes may then be queried, browsed, and used to prepare reports or generate flat files.

Abstract: Systems and methods for automatically processing a textual document by identifying occurrences of a piece of text having a predetermined format in the textual document; determining a depth-of-treatment value for each piece of formatted text in the textual document, the depth-of-treatment value indicating a depth of treatment in the textual document afforded to the particular piece of formatted text; associating an abstract with each piece of formatted text in the textual document; and generating a data record containing each identified piece of formatted text from the textual document, the depth-of-treatment value and the abstract associated with each piece of formatted text in the textual document.

Abstract: Techniques for using arbitrary sets of objects to constrain objects in database systems. The constraint set of objects is associated with the constrained object in the database system and the database system will perform an operation which adds an object to the constrained object only if the object being added belongs to the constraint set. In a preferred embodiment, the techniques are employed to obtain constraint sets of terms from ontologies which are then used to constrain columns containing those terms. An implementation of the techniques makes a materialized view out of the objects in the constraint set and uses the materialized view to define a referential integrity constraint on the constrained column.

Abstract: Methods and apparatus are described for partitioning native tables in a database cluster into logical tables. Each logical table is mapped into a unique portion of the native table by an intermediary server. Clients access a logical table as an ordinary, full-fledged database table through the intermediary server, which translates queries on the logical table into queries on the corresponding portion of the native table. The mapping may use the application name, logical table name, and a version number to create a native table key for each key in the logical table. A data structure storing these mappings may be stored at the intermediary server or in a native table in the database. This approach affords clients quick and flexible access to the database with better data integrity and security than native tables allow.

Abstract: Systems, methods, media, and other embodiments associated with dynamically ranging over a set of materialized views to determine whether to associate a materialized view with a query at execution time are described. One example system may include a materialized view creation time logic that is configured to identify a materialized view, to create a containment expression, and to relate the containment expression to the materialized view. The example system may also include an execution time logic that is configured to receive a query having a bind variable. The execution time logic may dynamically range over materialized views to determine whether to use a materialized view(s) to process the query having the bind variable.

Abstract: A method and apparatus for providing a mobile video blog (vlog) service in a communication network are disclosed. For example, the method captures video content sourced from a mobile device used by a mobile user through a mobile vlog posting service portal, and provides a vlog viewing function accessible to a viewer through a vlog viewing service portal, wherein the vlog viewing function affords viewing of the video content and is provided in accordance with a user profile of the viewer, wherein the user profile comprises a viewing preference of the viewer.

Abstract: In one embodiment the present invention includes a method comprising receiving a data filter for filtering a collection of data, wherein the collection of data is configured as a star schema including a fact table and dimension tables. The data filter is applied against the dimension tables to generate a modified dimension table. The modified dimension tables are applied against the fact table to produce a modified fact table. The data filter is then applied against the modified fact table to generate a second modified fact table, which is the output of the process.

Abstract: Systems and methods are described that provide for generating ordered search results based on dynamic web analytics data that allows a resulting list of records that is responsive to a query to be ranked in a fashion that improves user satisfaction and conversion success rate. The system interrogates a target website to build a database of products and services. The individual pages/products in the database of products and services are ranked based on analytics data. Responses to searches of the target website are ordered as list of records that reflects the analytics data, which improves the ordering of the list of records based on criteria such as web page popularity, product popularity, or conversion success rate. Further embodiments provide for the generation of appropriately ordered search engine feed data based on the ranked database of products and services for the target website as well as the generation of search engine sitemaps with an appropriate priority attribute based on the analytics data.

Abstract: Systems and computer program products that identify data that is related to and associated with data that has been selected from a multidimensional database. The overwhelming amount of data in a multidimensional database that may be viewed by a user, such as a data analyst, is reduced to the selected and associated data by use of index data and related index data, according to the present invention. The views of selected data and related data may be highlighted and formatted for presentation to the user. Further, irrelevant data is filtered out and not presented to the user. Existing systems have not been able to efficiently and adequately identify data that is related to and associated with selected data in a multidimensional database.

Abstract: A method, system, and computer program product for optimizing database queries in a data processing system. A query optimization (QO) utility maximizes the query coverage of Materialized Query Tables (MQTs) in order to efficiently process various types of incoming queries to a database engine. In particular, the QO utility enables MQT technology for nullable foreign key columns in a number of table joins involving fact tables and dimension tables, in which the fact tables and dimension tables have column data which are not null. The QO utility also enables MQT query matching for a relational database engine for non-additive measures, and improves the performance of existing query-matching capabilities for a relational database engine for additive measures. The QO utility specifies a number of functionally dependent relationships between the columns of a table in order to enhance the query matching abilities of the database engine.

Abstract: The present invention is generally directed to a system, method and article of manufacture for accessing data represented abstractly through an abstraction model. In one embodiment, a data repository abstraction layer provides a logical view of an underlying data repository that is independent of the particular manner of data representation. A query abstraction layer is also provided and is based on the data repository abstraction layer. A runtime component performs conversion of an abstract query (i.e., a request for results or a request to modify data) into a form that can be used against a particular physical data representation. Abstract and/or physical queries are transformed according to model entities which define a relationship between logical fields of the data repository abstraction layer.

Abstract: Disclosed is an apparatus and system for reducing locking in materialized query tables (MQT) for distributive functions. The apparatus includes an insert module that inserts into an MQT table a child record when a new record is inserted into a base table associated with the MQT. The child record includes values associated with the insert operation. Also included is a delete module that inserts into the MQT a child record that includes measure values that are the negative of the measure values in the base table row that is the subject of the delete operation. An update module inserts two child rows into the MQT, one negating the affected record and the other adding the values of the update operation. Each inserted child row includes a unique identifier that relates the inserted row to a parent row. An execution module generates responses using the values indicated by the cumulative records in a family.

Abstract: A method, system and computer program for processing materialized tables in a multi-tenant application system, wherein in the multi-tenant application system, a plurality of tenants share one or more basic-tables. According to the data access history information of the plurality of tenants, an update pattern analyzer analyzes the similarity of the update patterns for one or more basic-tables by the plurality of tenants. Furthermore, according to the similarity analyzed by the update pattern analyzer, a tenant grouping means groups the plurality of tenants into a plurality of tenant groups. Additionally, according to the tenant groups grouped by the tenant grouping means, a materialized table constructor constructs the tenant group materialized tables from the one or more basic-tables.

Abstract: Techniques are provided for improving efficiency of database systems, and in particular, to refreshing materialized views maintained by database systems and rewriting queries to access the materialized views. According to the approaches, a ranked materialized view is incrementally refreshed, and during the incremental refresh operation, rows in the partitions of the materialized view are ranked within the partitions.

Abstract: Alternative views for a selected distinguished name entry in current view are identified through subviews. Each subview corresponds to an attribute defined by a dynamic view object in a schema for a lightweight directory access protocol directory. The subviews are searched to find those that have entries that match the value of the selected distinguished name entry. In one aspect, the attribute is a virtual attribute.

Abstract: A graphical query and data mining interface provides visual feedback to a user during the construction of a query that helps the user determine the quality of the query as the query is being built. The graphical query and data mining interface determines relationships in the database from a database relationship document, such as an XML document. These relationships may be between columns, including columns in different tables. The relationship of columns in the database is then graphically displayed to a user. When the user selects a column in the database, a filtered display mechanism displays only those columns or records that satisfy the portion of the query already constructed. In this manner dynamic information is provided to the user as the user builds the query that indicates to the user the quality of the query.

Abstract: Some embodiments provide a method for processing metadata associated with digital video in a multi-state video computer readable medium. The method specifies a set of rules for propagating the metadata between different states in the video computer readable medium. It then propagates the metadata between the states based on the specified set of rules.

Abstract: A semantic query may refer to a logical rule, where the rule is defined in terms of constituent expressions. In order to execute the semantic query efficiently, occurrences of the rule may be expanded by replacing the rule with its constituent expressions. Expansion may be performed repeatedly, until only grounded expressions remain. Expressions are grounded when they refer to tables or views that are represented in an underlying database. Once the rule has been reduced to grounded expressions, the semantic query processor may formulate a relational query in terms of the grounded expressions. If the relational query takes into account the various grounded expressions to which the rule reduces, then the portion of the semantic query that refers to the rule may be processed without an excessive number of round trips to the relational database.

Abstract: The cost of running a query (having a query range) on a multidimensional database may be estimated using a process factors criteria beyond merely the number of affected records. First, a materialized view of the database may be represented as a container of tuples, sorted by key. Then keys may be stepped through, each key representing a mapping of a combination of tuples from the container. At each step, the process may request the next smallest key in the query range greater than or equal to the key of the current step, which results in the tuple in the database whose key is the smallest, greater than or equal to the requested key, and determine if the resulting is in the query range. The cost of the query may then be estimated as the number of tuples upon which the range check was performed.

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: Including search result based content in a webpage is disclosed. One or more search criteria and an indication that a search result based content associated with the search criteria is to be included in a web page are received. A computer script or code configured to enable the search result based content to be retrieved in accordance with the search criteria is generated automatically for the web page.

Abstract: In a system and method for organizing database search criteria match results which are generated through a search engine adapted to generate system databases upon the processing of search criteria established and submitted by a system user, the system is adapted to define and group the search criteria match results for presentation to the user based upon the relative emphasis or de-emphasis of such results. The system includes a context software module, for enabling the generating of a context database consisting of content, links, and layouts organized for presentation to the user, which module is adapted to determine and specify the context database based on a current context and settings. The system also includes a criteria software module for enabling the generating of a comparison database, adapted to enable criteria to be submitted, modified, and input by the user to generate comparison database information.

Abstract: Methods and apparatus, including computer program products, for a query response service for business objects. In general, data characterizing a request to perform a query on multiple instances of a business object may be received, where the query includes selection criteria for multiple attributes across multiple nodes for each of the instances of the business object. The query may be initiated on the instances of the business object. Results including values from the attributes across the nodes of the business objects may be returned. The query may be assigned to a node of the business object, which may be a query response transformation node. The node may include a combination of attributes associated with the attributes across the nodes of the business object. Results may be sorted on a server, sent as pages to a client, or both.

Abstract: Methods, systems, and mediums for providing search functionality. A user interface can include a plurality of input elements. Various searches can be executed based on inputs to the input elements. A result set of documents and a search history can be displayed simultaneously. The search history can be displayed via the plurality of input elements. This can facilitate efficient perusal of search results and efficient modification of a search strategy. Accordingly, a user can quickly and efficiently review and analyze the results of a search. Additionally, the user can quickly and efficiently modify the search strategy to obtain new or refined results if determined that the original results are not as desired.

Abstract: A set of algebraic rules applicable to a query are identified, wherein each of the algebraic rules represents a relationship between two columns in a relational database table. A source column is identified by searching the query for a source predicate, wherein the source predicate is a range predicate. One or more candidate target columns are identified by searching the set of algebraic rules, wherein each of the candidate target columns occurs on one side of a binding expression and the source column occurs on the other side of the binding expression. For each of the one or more candidate target columns, a bounds subquery that provides a lower bound and an upper bound for a new range predicate is derived and he new range predicate is introduced into the query, wherein the query is executed to retrieve data from one or more data stores.

Abstract: Techniques are provided for improving efficiency of database systems, and in particular, to refreshing materialized views maintained by database systems and rewriting queries to access the materialized views. According to the approaches, a ranked materialized view is incrementally refreshed, and during the incremental refresh operation, rows in the partitions of the materialized view are ranked within the partitions.

Abstract: A method and system for collecting and reviewing data related to web services receives service criteria from a service requester, selects candidate services that match the service criteria, invokes the selected candidate services, and aggregates results provided by the candidate services. In conjunction with aggregating results, the method and system builds service result objects conforming to a composite schema constructed from the various result schemas. To increase the utility of the aggregated results, metadata such as an invocation timestamp are also attached to each service result object. Result values are inspected and enumerated within a results table that may be used to determine which service result objects contain a particular result value.

Abstract: A method for providing a link in an electronic file being presented to a user which includes defining a customized viewpoint for the user. The viewpoint includes a preference for the user that provides an association between a data pattern and a computer network resource. The method also includes generating a request for content, receiving an electronic file in response to the request, and evaluating the electronic file to recognize a match between at least one portion of the electronic file and the data pattern. Upon recognizing a match, the electronic file is modified to include a link to the computer network resource associated with the matching data pattern, and the modified electronic file is presented to the user. Thus, the link included in the electronic file presented to the user is customized for the user, and different users who retrieve the same content can be provided with links to different computer network resources depending on their respective viewpoints.

Abstract: Systems and methods that generate specialized plans for compiling SQL queries. A plan generator component scans the query representation for parameter sensitive predicates and evaluates each predicate individually based on the parameter values. Accordingly, queries can be identified not only based on their structures, but also based on their parameter conditions. The specialized plans are more efficient for particular values, wherein queries that employ such values are optimally executed.

Abstract: A technique for refreshing materialized views in a database is disclosed. The detail table is partitioned, and changes made to the detail table are tracked with information stored, for example. Only sections in the materialized view which correspond to the partitions which include modifications made to the detail table are refreshed, thus avoiding the need of a complete refresh to overcome staleness.

Abstract: Techniques described herein adaptively select materialized view fragments for persistent maintenance. During an interval of time, the selected fragments are persistently maintained in the database system, while the other non-selected fragments are not persistently maintained as materialized view fragments. Over time, the composition of the set of selected fragments may change. As queries are executed in the database system over an interval of time, statistics including the frequency of access of each currently selected fragment during that interval are generated. At the start of the next interval of time, based on these statistics, some currently selected fragments may be unselected. Some currently non-selected fragments of one or more candidate materialized views may be selected based on the statistics.

Abstract: A multi-dimensional table having plural dimensions is stored in a database system, where plural grouping combinations of the plural dimensions define corresponding subsets of the multi-dimensional table. An aggregate measure for each of at least some of the plural subsets is computed, where the aggregate measure for a particular subset represents a relationship of the particular subset to one or more parents of the particular subset. Less than all of the at least some subsets are selected to materialize based on the aggregate measures.

Abstract: Techniques are provided for improving efficiency of database systems, and in particular, to refreshing materialized views maintained by database systems and rewriting queries to access the materialized views. According to the approaches, a ranked materialized view is incrementally refreshed, and during the incremental refresh operation, rows in the partitions of the materialized view are ranked within the partitions.