Abstract: Systems and methods for storing and accessing data. A query language statement may reference a plurality of data sets and a plurality of algebraic relations between the data sets may be composed from the query language statement. The algebraic relations may be used to define new data sets and to optimize access to data sets. A store of algebraic relations may be accumulated over time. Alternative collections of algebraic relations may be generated and evaluated to determine an optimized collection of algebraic relations to use in calculating and providing a requested data set. The optimization may be performed using the algebraic relations rather than retrieving underlying data sets from storage. As a result, optimization may be performed at processor speeds to minimize the amount of time required for data to be retrieved from slower storage.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for identifying a group of related instance identifiers. In one aspect, a computer storage medium is encoded with a computer program. The program comprises instructions that when executed by data processing apparatus cause the data processing apparatus to perform operations. The operations include receiving a search query at a data processing apparatus, the search query specifying attributes shared by a group of related instances, searching an electronic document collection to identify instance identifiers that are responsive to the search query, representing features of the instance identifiers in a vertex-edge graph, and scoring relevance of the instance identifiers to the search query according to the features represented in the vertex-edge graph.

Abstract: Systems, methods, and computer media for enhancing user search query results are provided. Upon receiving a user search query, relevant images are identified. Duplicate image information for the relevant images is accessed in an index. The index includes information extracted from individual images or duplicates and information aggregated according to groups comprised of images and duplicates of the images. The images identified as relevant to the user query are ranked based at least in part on the information accessed in the index.

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 database system and a method of optimizing cross-database query. The database system includes a plurality of databases. At least two of the databases are stored with one or more data collections composed of tables with the same structure. A federated view of the data collection is created on each of the databases. A request routing layer for routing, in response to a query request crossing the data collections, the query request crossing the data collections to one of the at least two databases according to a predetermined routing rule, so as to query by using the federated view of the database.

Abstract: Methods and systems are provided for click through rate prediction and advertisement selection in online advertising. Methods are provided in which output information from a feature-based machine learning model is utilized. The output information includes predicted click through rate information. The output information is used to form a matrix. The matrix is modeled using a latent variable model. Machine learning techniques can be used in determining values for unfilled cells of one or more model matrices. The latent variable model can be used in determining predicted click through rate information, and in advertisement selection in connection with serving opportunities.

Abstract: Accessing data in a data store at a field granularity. A method includes receiving a query from a user. The query specifies one or more non-unique fields of a record. The method further includes sending the query to a data store to retrieve the fields of the record at a field granularity. The method further includes receiving data for the one or more non-unique fields of the record at a field granularity.

Abstract: An approach is provided for presenting video assets. An asset manager determines a plurality of factors for positioning of video assets represented on a graphical user interface. The asset manager then determines weighting of the factors using one or more rules that are based on a search operation or a browse operation relating to the assets. From the determined plurality of factors and weighting of the factors, the asset manager computes a score for ranking of a particular one of the assets with respect to the positioning of other ones of the assets.

Abstract: Systems, methods, and computer storage media having computer-executable instructions embodied thereon that utilize relevant user profile data for advertisement selection. An advertisement context string is referenced. One or more related context strings that are related to the advertisement context string are identified. The advertisement context string and the one or more related context strings are compared to user profile strings associated with a user. It is determined that at least one of the advertisement context string or the one or more related context keywords is similar to at least one of the user profile strings. Any of the similar strings can be utilized to select an advertisement to be presented to the user.

Abstract: A new database design is implemented in which everything in the database is modeled with primitives, including the links and nodes for a graph tuple store. A query syntax provides a nested tree of constraints with a single global schema. Various optimization techniques for queries and replication techniques are also 10 described.

Abstract: A middleware system is provided that is situated between the user applications and the various content databases that are to be searched in order to simplify the creation of user applications for mobile devices that use location-based services that employ ontology-based search systems. The middleware system exposes one or more services to the user application. For example, a service exposes a service that allows the user to annotate and/or tag known semantic locations. As another example, a service provides a list of suggested semantic POIs to user applications in response to user queries. The suggested semantic POIs are selected based on a user's location and possibly context-dependent information. The suggested semantic POIs also may be based on user-dependent information obtained from a user-profile or the like and the suggested semantic locations that are provided to the user applications may be ranked and presented in an order beginning with those semantic locations that may be of greatest interest.

Abstract: A method of incrementally refining queries and updating query result lists without requiring a user to provide an explicit indicator of query submission. In the method, one or more query related character patterns are defined. Entry of query defining characters by a user is monitored to detect entry of a defined query related character pattern. The user is provided with one or more suggested query refinement options and an updated query result list each time a defined query related character pattern is detected. The query related character patterns may be a character pattern that indicates a word has been input by the user.

Abstract: Methods and systems for query optimization for a multi-tenant database system are provided. Some embodiments comprise receiving at a network interface of a server in a multi-tenant database system an original query transmitted to the multi-tenant database system by a user associated with a tenant, wherein the original query is associated with data accessible by the tenant, and wherein the multi-tenant database system includes at least a first index and a second index. Metadata associated with the data is retrieved, wherein at least a portion of the data is stored in a common table within the multi-tenant database system. A tenant-selective query syntax is determined by analyzing at least one of metadata generated from information about the tenant or metadata generated from the data accessible by the tenant.

Abstract: There is provided a computer-implemented method of optimizing a query. An exemplary method comprises receiving a first query configured to generate a result set. The query may comprise an operation for an outer table, a first predicate, and a second predicate. The second predicate may comprise a subquery correlated to the operation. Additionally, the first predicate and the second predicate may be disjunctive. The exemplary method also comprises generating a first query tree representing the first query, and generating a second query tree representing a second query. The second query may be configured to generate the result set, and may not comprise the subquery. The exemplary method additionally comprises generating a query plan based on the second query tree.

Abstract: A search platform that can generate intellectual property intelligence within an organization using a patent search engine. The patent search engine can monitor and log activity of users in connection with patent-related activities, such as searching, commenting on, and reviewing patent documents associated with a shared workspace of the organization. Based on this captured activity, the search engine can provide the organization with statistical information in patent-related activities occurring within the organization.

Abstract: A transformative, machine based process for choosing real estate to purchase which automatically compiles a list of weighted preferences for a plurality of attributes which the user considers important in making a decision to purchase real estate, then assigns a numerical score to be initially assigned for each of such individual preference attributes, and which generates a report which can efficiently be used to decide which property to purchase.

Abstract: A method, system and computer program product are disclosed for searching for an inferred lexical answer type from the context of a question. One embodiment comprises determining from a question an original lexical answer type (LAT), extracting the context in which said original LAT occurs within the question, and identifying a set of context fragments from said context. This embodiment further comprises using the set of context fragments to search through a defined database to produce a search result including a plurality of text strings having a specified relationship with said context fragments, and processing said search result to search for one or more inferred LAT of the question. In one embodiment, the processing includes extracting a plurality of LATs from the text strings in the search result, and selecting one or more of the extracted LATs as the one or more inferred LAT of the question.

Abstract: A method for categorizing online user behavior data, including creating a target set of users based on an advertiser query, identifying two or more users in the target set having one or more first similar behavior attributes using a Minhash algorithm; and modifying the target set according to the two or more identified users.

Abstract: A time-weighted score accumulation system and method are provided herein.

Abstract: A method of report caching includes recording a user ID, a timestamp including at least a connection date and at least one SQL query associated with a report requested by a user from the database system for each connection of the user to the database system over a predetermined period. A plurality of intervals is defined in the predetermined period. Retrieved are instances of the user ID associated with connections of the user to the database system during at least a threshold number of the intervals based on a position that a current date associated with a current connection of the user to the database system occupies in a current interval. The at least one SQL query is executed to generate the report from the database system on the current date before request for the report from the user. The report is stored in a cache for user's retrieval.

Abstract: A pattern analysis system enables a user to obtain specific analysis from multi-dimensional storage structures. The patterns analysis system guides the user interaction through the selection of specific available patterns. This enables the user to gain access to analytics data available in the multi-dimensional storage structure without specific knowledge of a command system syntax or semantics. Also, the user does not need knowledge of the contents or organization of the multi-dimensional storage structure.

Abstract: In one embodiment, concept tag a network document comprising document words based on a set of document concepts, each of the document words being indexed with its position within the network document, such that for each of the document words, if the document word represents one of the document concepts, index a document concept tag corresponding to the one document concept with the position of the document word within the network document. Concept tag a search query based on a set of query concepts by associating appropriate query concept tags with selected query words. For each of the query words associated with the query concept tags, determine zero or more first positions within the network document at which the document words match the query word or its synonym and zero or more second positions within the network document at which the document concept tags correspond to the query concept tag.

Abstract: A method for transmitting advertisements to a communication device comprises the steps of: a communication device transmitting a search instruction to a content aggregating apparatus, wherein the search instruction comprises at least a keyword, the location of the communication device, a user account and a time stamp; performing an Internet search based on the given keyword and the location of the communication device; optimizing the search results; transmitting the optimized results in an XML format to the communication device; transmitting advertisements to the communication device according to the keywords and the location of the communication device; providing a short message to an inbox of the communication device according to the advertisement; and notifying a user of the incoming short message.

Abstract: Proposed are a method and apparatus to improve the food market advertisement in a geo-spatial environment. The goal is achieved by a uniform inventory presentation of the local food store on a common Internet site. That in turn motivates the vendors to participate in a disclosed service, and attracts the customers by a competitive pricing layout. An embodiment determines “on-the-fly” some local gourmet preferences to facilitate the regional and ethnic food market advertisement. The goal is achieved by extracting the evocative product features from the food descriptions provisioned by vendors. Anticipating a massive network load, the proposal also includes an algorithm of allocating a distributed structure to optimize the system's load balance.

Abstract: Systems and methods are disclosed that detect uninsured vehicles. An insurance monitoring system described herein receives a message over a mobile network from a mobile device embedded in a vehicle, where the message from the mobile device includes a vehicle identification for the vehicle. The insurance monitoring system queries an insurance database based on the vehicle identification to determine whether the vehicle is uninsured. If the vehicle is uninsured, then the insurance monitoring system sends a notification message to a law enforcement entity.

Abstract: There is provided a computer-implemented method of optimizing a query. An exemplary method comprises determining a maximum cardinality for an operator. The query may comprise the operator. The exemplary method also comprises determining a plurality of potential implementations for the operator. The exemplary method additionally comprises generating a query plan for the query based on the maximum cardinality and the potential implementations.

Abstract: After a change of location of an avatar in a virtual universe, an avatar is encouraged to remain at that location and avoid an immediate further or return change of location (e.g. by teleportation) by prioritizing rendering of objects such that objects most likely to be of interest to the avatar is performed prior to rendering of objects less likely to be of interest. Prioritization is performed by comparing metadata concerning objective(s) of the avatar and metadata of preferences of the avatar and objects in the avatar's inventory and/or implied from the avatar's activity history with metadata corresponding to objects at the location to which the avatar moves. Preferably, the metadata corresponding to the avatar is ranked in order of the number of occurrences of metadata terms and synonyms in metadata of the avatar.

Abstract: A mechanism for efficiently determining similarity between documents. A set of reference data items is generated by processing a reference document. A similarity index representing similarity between a candidate document and the reference documents is obtained by counting segments of the candidate document matching the reference data items. The candidate document is a message transmitted in a communication system where the message is compared against one or more reference documents representing unwanted messages to filter and block unwanted messages from being transmittal or propagated.

Abstract: A system and method for join order optimization in a query optimizer is disclosed. The method includes receiving a query having a plurality of join operators, including at least one multi-way join between relational operators in the query tree. The join operators include at least one outer-join and/or semi-join. The multi-way-join is transformed to a multi-join operator with a plurality of join back bone children representing the relational operators. The dependencies that occur between the join back bone children are tracked. Join order validity is evaluated based on the tracked dependencies. One or more multi-join rules are applied to the multi-join operator sufficient to generate at least one join subtree when at least one join subtree is determined to have a valid join order.

Abstract: There is provided a computer-implemented method of optimizing a query. An exemplary method comprises receiving a first request from an optimizer that specifies a table, a first predicate and a first sample size, wherein the optimizer is optimizing a relational query language statement that specifies the table and the first predicate. The exemplary method also comprises generating a sample table, comprising a first subset of rows from the table, based on the request. The exemplary method also comprises selecting a second subset of rows from the sample table based on the predicate. The exemplary method additionally comprises sending a count of rows in the second subset to the optimizer.

Abstract: Methods and systems are disclosed for generating non-overlapping facets for an original query that is submitted for a search.

Abstract: An approach is provided for reducing decision diagram related communication traffic and cost by utilizing existing hash identifiers of decision diagrams. A hash identifier application receives a plurality of hash identifiers computed based on a respective plurality of reduced ordered binary decision diagrams constructed for resource description framework graphs. Thereafter, the hash identifier application initiates storage of the hash identifiers for use and subsequent reuse.

Abstract: A method provided for optimizing a query expression on a database engine of a database server. The query expression is sent to the database engine. The query expression contains a plurality of query language elements. The database engine initiates query processing of the query expression. An evaluation counter within the database engine increments an evaluation counter value corresponding to a query language element result. A flag is set within the database engine when the evaluation counter value reaches a threshold value. The database engine can then evaluate the efficiency of the query language elements in the query expression by comparing the evaluation counter value for each query language element against a set of optimization criteria.

Abstract: A query may execute on stored original stream data obtained from stream data received from at least one data source. The original stream data may be deleted in association with new stream data being received. At least one operator of the query may be duplicated to obtain at least one duplicated operator, and the stored original stream data may be duplicated to obtain duplicated stream data. The at least one duplicated operator may be modified to obtain at least one modified operator and, thereby, a modified query. Original results may be determined based on execution of the at least one operator, and modified results may be determined based on execution of the at least one modified operator. The at least one operator and the original stream data may be replaced with the at least one duplicated operator and the duplicated stream data, to thereby obtain an integrated query for execution.

Abstract: A system, method, and computer-readable medium that provide mechanisms for tracking the number of queries received for processing for a workload to facilitate arrival rate qualifications to Throughput Service Level Goals are provided. A number of queries counter associated with a particular workload is incremented each time a query assigned to the particular workload is received thereby tracking the arrival rate of workload queries. When a system performance condition comprising a non-compliant system performance level with respect to a Throughput Service Level Goal is identified, the number of queries counter is compared with the Throughput Service Level Goal. If the arrival rate of queries for the workload is greater than the Throughput Service Level Goal of the workload, actions associated with non-compliance of the Throughput Service Level Goal may then be performed.

Abstract: In one embodiment, access a first one of one or more network resources, the first network resource comprising one or more keywords. For each of the keywords of the first network resource: request a search engine to conduct a search on the keyword; obtain one or more second ones of the network resources identified by the search engine as a result of the search conducted on the keyword; and associate the second network resources identified for the keyword with the keyword. Rank the keywords of the first network resource according to their relative degrees of popularity based at least on a number of the network resources tagged with the keyword. Visually distinguish the keywords of the first network resource according to their popularity ranking.

Abstract: A method, system and computer-usable medium are disclosed for the correlation of network events. A port of a network device is monitored at the physical layer interface for the occurrence of a network event. If detected, a repository of circuit path, network device, and device interface data is queried for information related to the network event and each network device at each hop of the circuit path associated with the event. A user selects time intervals for other network events or alarms occurring before or after the target event. A repository of network event and alarm data is then queried to retrieve all network events or alarms occurring during the selected time interval. Information related to the network events or alarms are then compared to interfaces related to devices that are likewise associated with the circuit path associated with the event. If the event information does not match the interface, then it is associated as a child event of a network circuit event.

Abstract: Techniques for determining whether an XML query may be written are provided. In one scenario, an XML query includes an expandable path, which is a path expression that includes a wildcard character (*) or a descendant axis (//). An XML schema is used to generate multiple expanded paths (each of which is a simple path expression) from the expandable path. The XML schema is used to compare each expanded path to another expanded path and to determine whether the nodes identified by the respective expanded paths are guaranteed to occur in a particular order in XML documents that conform to the XML schema. In another scenario, an XML query includes an order operator that takes two paths as input. Similarly, an XML schema is used to compare the two paths and to determine whether the nodes identified by the two paths are guaranteed to occur in a particular order in XML documents that conform to the XML schema.

Abstract: Methods, program products, and systems for displaying data in formatted views using reference files are described. In some implementations, a database application program can generate a result set using one or more queries. The result set can contain actual data from a database and metadata. The metadata can contain references to data records in the database, the references can include identifiers that can identify the data records. When a user saves a database report file, the user can save at least a part of the result set using the identifiers instead of the queries and layouts. Thus, the result set can be saved as a reference file. When the database application program opens the saved reference file, the database application program can reproduce the result set using the stored references without running all of the queries.

Abstract: A system and/or method are implemented to process queries to a database. In particular, the processing of queries to the database is enhanced by enhancing the determination of join orders of tables implicated in queries. Join orders between relatively large numbers of tables are determined by dividing the set of tables to be ordered into a plurality of subsets of tables, and ordering the individual subsets of tables.

Abstract: System, method, computer program product embodiments and combinations and sub-combinations thereof for tuning query execution performance in a database management system are described. In an aspect, query optimization in a database management system (DBMS) with memory I/O (input/output) awareness includes determining compensated physical I/O (PIO) values indicative of memory I/O operations, including an approximate cache occupancy level, of an executing query in a DBMS, and utilizing the compensated PIO values as feedback to a query optimizer of the DBMS for optimization of future query execution.

Abstract: Best-bet recommendation may be provided. User behavior associated with a search result may be logged and applied to a relevance classifier. The relevance classifier may determine whether the user behavior indicates that the search result may comprise a best-bet result. A best-bet result may comprise a result associated with a high confidence that the result may be satisfactory to a user. The relevance classifier may be trained according to past searches and user behavior to improve the confidence on best-bet recommendations. Once confidence in a search result is high enough, future searches on the same query may provide the best-bet result to the searching user.

Abstract: A computer implemented method for automatically generating an artist coordinated image display based upon a user's favorite image or images. A plurality of digital image templates are stored in a computer accessible memory each having programmed characteristics associated therewith that are designed by an artist with one window being a primary window. The characteristics of the template can be programmed and stored, including number, location, shape, color, etc, of windows in the digital template. Color and texture characteristics of a body of the template can be selected to resemble, for example, a frame, which will eventually hold the printed images of the template for display. The windows of the template have stored image attribute requirements associated therewith that are designed by the artist are correlated to match image attributes of at least one user selected image.

Abstract: A method for estimating the selectivity of a database base table predicate, the cardinality of a join, and the cardinality of an aggregation. The method includes receiving a database query, the query comprising one or more query predicates and referencing one or more database tables. One or more join indexes are identified, the join index(es) defined on respective database tables referenced by the database query. The join index(es) comprises one or more join index predicates, and includes one or more join columns in its select list. The row count selected by the query predicates is calculated at least partly using the row count or statistics of the one or more join indexes. The selectivity of the base table predicate is calculated at least partly from the calculated row count. The cardinality of the join is estimated at least partly from the row count and statistics of the identified join index(es).

Abstract: Bounding of large queries is provided in a network analysis environment by receiving a user query of a data set of network transactions, submitting a meta data query to the data set to determine whether the query would require an unreasonable amount of time to complete, and notifying the user to re-formulate the query if it would require too much time.

Abstract: Disclosed is a computer-implemented search method and computer-implemented agent system for efficient searching of information. Information may be located, for example, on XML databases, relational databases and files located on intranets and the Internet or other like computer network systems. Specifically, a service-oriented system architecture (also referred to as the Knowledge Sifter architecture), may be comprised of a community of cooperating agents. The system architecture may further be employed using a case-based framework configured to recommend query specifications and refinements based on previously-stored user-query cases. Other methodologies such as collaborative filtering, wherein the architecture can recommend a set of unseen items that are preferred by other users to the active user, can be used. Additionally, a hybrid filtering approach which combines both collaborative filtering and content-based filtering can be used effectively in the Knowledge Sifter architecture.

Abstract: Embodiments of the present invention partition optimized query plans into equivalence groups, each comprising one or more equivalence classes. Each equivalence group corresponds to a particular compiled, normalized, and parameterized query plan prior to optimization. Each equivalence class within an equivalence group corresponds to a different query plan corresponding to the particular compiled, normalized, and parameterized query plan represented by the equivalence group that has been optimized with respect to the selectivity of one or more predicate clauses of the query that is compiled to produce the particular compiled, normalized, and parameterized query plan. Optimized query plans are cached according to their respective equivalence groups and equivalence classes.

Abstract: A method, system and apparatus for a assigning keywords to a web page using keyword data from the web page itself, web pages having links pointing to the web page, and web pages pointed to by a link in the web page, wherein the keyword data from the multiple web pages is processed to provide a relevant set of keyword data for the web page.

Abstract: Embodiments of the present invention are directed to facilitating tag assignment to data objects as data objects are added to a tag-associated data-object storage system by users of the tag-associated data-object storage system and to facilitate subsequent display, access, and further characterization of data objects that already reside in the a tag-associated data-object storage system. Methods and systems of the present invention provide for automated tag suggestion to users in order to both increase usability of the interface provided to the tag-associated data-object storage systems as well as decrease the likelihood of unnecessary and unproductive tag proliferation within the tag-associated data-object storage system.

Abstract: An apparatus and method for a multi-partition query governor in a partitioned computer database system. In preferred embodiments a query governor uses data of a query governor file that is associated with multiple partitions to determine how the query governor manages access to the database across multiple partitions. Also, in preferred embodiments, the query governor in a local partition that receives a query request communicates with a query governor in a target partition to accumulate the total resource demands of the query on the local and target partitions. In preferred embodiments, a query governor estimates whether resources to execute a query will exceed a threshold over all or a combination of database partitions.