Abstract: Systems, methods and articles of manufacture are disclosed for matching an inbound identity record to existing entities. Entity resolution (ER) candidate-building keys may be determined for a received identity record. A query may be generated from the ER candidate-building keys. When executing the query, a generic key may be identified. Execution of the query may be aborted upon a condition involving the generic key being satisfied.

Abstract: Methods and computer-readable media are provided for receiving keyword expansions from expansion providers and selecting a set of keyword expansions that are used for advertisement selection. Keyword expansions that correspond to a particular search query or text from a browsed web page are received from an expansion provider. Feature data is extracted from each keyword expansion, and may include properties of the keyword expansion or the expansion provider. A score is assigned to each keyword expansion, and based on the score, a set of keyword expansions is selected from the keyword expansions received from the expansion provider. The set of keyword expansions is used to select relevant advertisements for presentation to the user.

Abstract: Architecture that includes an index creation algorithm that utilizes available resources and dynamically adjusts to successfully scale with increased resources and be able to do so for any data distribution. The resources can be processing resources, memory, and/or input/output, for example. A finer level of granularity, called a segment, is utilized to process tuples in a partition while creating an index. The segment also aligns with compression techniques for the index. By choosing an appropriate size for a segment and using load balancing the overall time for index creation can be reduced. Each segment can then be processed by a single thread thereby limiting segment skew. Skew is further limited by breaking down the work done by a thread into parallelizable stages.

Abstract: In one embodiment, access one or more query-resource pairs, wherein for each one of the query-resource pairs comprising one of one or more search queries and one of one or more network resources, the one search query is recency-sensitive with respect to a particular time period, and the one network resource is identified for the one search query, and a resource-view count and a resource-click count associated with each one of the query-resource pairs; and construct one or more first click features using the resource-view counts and the resource-click counts associated with the query-resource pairs. To construct one of the first click features in connection with one of the query-resource pairs comprises determine a only-resource-click count associated with the one query-resource pair; and calculate a ratio between the only-resource-click count and the resource-view count associated with the one query-resource pair as the one first click feature.

Abstract: Data is published by publishers to an information service configured to receive data sets and allow consumers to consume the data sets via queries. Structural information of the data sets (e.g., column information) is presented to the publishers to select which information of the data sets can be a search parameter and which information can be returned in query results. Query interfaces are automatically created based on the selections by the publisher, and the back end databases are optimized for such query interfaces, e.g., creation of indexes based on the search parameters or query results selected by the publisher. A query aggregator can automatically combine a given query interface with other query interfaces to form more complicated (but still permitted) queries based on the intersection of permissions for the given query interface and the other query interfaces.

Abstract: Embodiments of the present invention provide a hardware accelerator that assists a host database system in processing its queries. The hardware accelerator comprises special purpose processing elements that are capable of receiving database query/operation tasks in the form of machine code database instructions, execute them in hardware without software, and return the query/operation result back to the host system. For example, table and column descriptors are embedded in the machine code database instructions. For ease of installation, the hardware accelerators employ a standard interconnect, such as a PCle or HT interconnect. The processing elements implement a novel dataflow design and Inter Macro-Op Communication (IMC) data structures to execute the machine code database instructions. The hardware accelerator may also comprise a relatively large memory to enhance the hardware execution of the query/operation tasks requested.

Abstract: An organic search ranking of a web page for a particular search query can be optimized by publishing a large number of short, subsidiary web documents associated with the web page. The web page and the associated web documents can be individually optimized in terms of one or more parameters based upon web analytical data compiled for the search query. The web page and associated web documents can also be jointly optimized by coordinating the content of the associated web documents to align with the primary web page, and further by providing a network of links between the associated web documents and the primary web page. To provide greater insight and to assess the overall efficacy of the web presence optimization effort, historical search rank data can be correlated with specific events and reported to a user.

Abstract: A method for monitoring search performance on a server computer includes determining the processing time for a plurality of operations related to a search on the server computer. The determined processing time for each of the plurality of operations is stored in a database. Aggregate processing times are determined for the plurality of operations and the aggregate processing times are stored in the database.

Abstract: A method and system for efficiently answering a local neighborhood aggregation query over graph data. A graph which has a plurality of nodes is received and stored in memory. A local neighborhood aggregation query is received. A processing engine applies forward processing with differential index-based pruning, backward processing using partial distribution, or an enhanced backward processing that combines the backward processing and the forward processing. As a result of the forward, backward, or enhanced backward processing, nodes in the graph that have the top-k highest aggregate values over neighbors within h-hops of the nodes are determined. Identities of entities or persons associated with the determined nodes are presented and/or stored.

Abstract: Systems and methods of the present invention provide for the spinning and appraisal of a domain name. A list of keywords may be extracted from a domain name entered into a user interface on a client. These keywords may be compared to potential matches in a database and a result set may be compiled and displayed to the user. The client may also display a certified domain name appraisal using a plurality of logical groupings within a domain name appraisal process. This appraisal process may also include a multiplier derived from comparisons of registration statistics for various top level domains.

Abstract: Systems and methods of the present invention provide for the spinning and appraisal of a domain name. A list of keywords may be extracted from a domain name entered into a user interface on a client. These keywords may be compared to potential matches in a database and a result set may be compiled and displayed to the user. The client may also display a certified domain name appraisal using a plurality of logical groupings within a domain name appraisal process. This appraisal process may also include a multiplier derived from comparisons of registration statistics for various top level domains.

Abstract: The invention concerns the compression, querying and updating of tree structured data. For example, but not limited to, the invention concerns a synopsis (16) of a database system that is used in the selection of the optimal execution plan (10) for a query (8). Compression is based on representing the data as a set of definition and compressing the data by consolidating the number of definitions. A selectivity estimate can be determined based on this compressed representation, including a maximum and minimum selectivity count. The invention also provides a way to update the compressed version of the tree data without uncompressing large amounts of the compressed data unnecessarily. Aspects of the invention are methods, computer systems and software for performing the invention.

Abstract: Systems and methods of the present invention provide for the spinning and appraisal of a domain name. A list of keywords may be extracted from a domain name entered into a user interface on a client. These keywords may be compared to potential matches in a database and a result set may be compiled and displayed to the user. The client may also display a certified domain name appraisal using a plurality of logical groupings within a domain name appraisal process. This appraisal process may also include a multiplier derived from comparisons of registration statistics for various top level domains.

Abstract: Methods, database management systems (“DBMS”) and computer-readable media are provided for processing unbounded stream data using a traditional DBMS. Execution of a query that includes a data stream as a data source may be initiated. Tuples may be processed in accordance with the query as the tuples are received through the data stream until an indication is received that execution of the query should cease.

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: An apparatus and program product that utilize at least one prematurely terminated processing of a database query to improve the processing of the database query. The embodiments discussed track termination information associated with at least one user initiated premature termination of processing of a database query to improve the processing of the database query. Information related to the premature terminations of a database query may be utilized by a DBMS to generate and/or implement suggestions to improve the processing of the database query, resulting in improved query processing, improved performance, fewer premature terminations, and more satisfied users.

Abstract: Methods, computer-readable storage media and computer systems are provided for transforming a directed acyclic graph (“DAG”) query plan into a linear plan. A DAG query plan may include a first operator and a second operator that are scheduled to be executed in parallel. The DAG query plan may be modified so that the first and second operators are executed in series as an upstream operator and a downstream operator. A data unit output from the upstream operator may be marked to indicate that the data unit has been processed by the upstream operator. The data unit received as input at the downstream operator may be inspected to determine whether the data unit has been marked. Once in linear form, the query plan may be optimized to conserve computing resources.

Abstract: A method for compressing an initial dataset may be implemented on a data processing system. The method may include generating a group of bootstrap samples of wavelet coefficients from the initial dataset using a wavelet basis function. An average quantile of the group of bootstrap samples of wavelet coefficients may be determined. The group of wavelet coefficients may be compressed by deleting initial wavelet coefficients having magnitudes less than the coefficient cutoff value equal to the average quantile. The compressed group of wavelet coefficients and the wavelet basis function may be used to approximate the initial dataset.

Abstract: A networked data processor maintains a database of information concerning potential evidence from litigants in legal proceedings supporting stipulated discovery agreements, and requiring meet-and-confer sessions prior to seeking court supervision. Individual or adverse parties can participate. Sources include data custodians, file repositories, electronic data, witnesses, etc. Managers and employees are polled to populate a database defining the litigant's organization and evidence. The evidence may be sequestered, copied and processed, e.g., filtered for confidentiality or privilege, analyzed as to format, and queried to assess the volume of data that would be responsive under alternative discovery specifications. Cost and time are assessed under alternative specifications and reports are provided for use in negotiating a discovery plan. A stipulated discovery plan may result, or if not, a meet-and-confer session is electronically managed in a multi-user teleconference.

Abstract: A “Community-Based Mobile Search Cache” provides various techniques for maximizing the number of query results served from a local “query cache”, thereby significantly limiting the need to connect to the Internet or cloud using 3G or other wireless links to service search queries. The query cache is constructed remotely and downloaded to mobile devices. Contents of the query cache are determined by mining popular queries from mobile search logs, either globally or based on queries of one or more groups or subgroups of users. In various embodiments, searching and browsing behaviors of individual users are evaluated to customize the query cache for particular users or user groups. The content of web pages related to popular queries may also be included in the query cache. This allows cached web pages to be displayed without first displaying cached search results when a corresponding search result has a sufficiently high click-through probability.

Abstract: One method includes receiving a database query, receiving information about a database table in data storage populated with data elements, producing a structural representation of the database table that includes a formatted data organization reflective of the database table and is absent the data elements of the database table, and providing the structural representation and the database query to a plan generator capable of producing a query plan representing operations for executing the database query on the database table. Another method includes receiving a query plan from a plan generator, the plan representing operations for executing a database query on a database table, and producing a dataflow graph from the query plan, wherein the dataflow graph includes at least one node that represents at least one operation represented by the query plan, and includes at least one link that represents at least one dataflow associated with the query plan.

Abstract: A system and method for a search engine is disclosed. A method for operating a search engine may include calculating a plurality of document vectors, receiving a search request, calculating a search request vector, calculating a distance between the search request vector and the plurality of document vectors, and returning a list of documents that are within a predetermined distance of the search request vector. An information handling system for a search engine may include a central processing unit that is coupled to a general purpose graphical processing unit. The central processing unit is able to calculate a plurality of document vectors, receive a search request, calculate a search vector, and return a list of documents that are within a predetermined distance of the search request vector. The general purpose graphical processing unit is able to calculate a distance between the search request vector and the plurality of document vectors.

Abstract: An execute request is sent to a search component. The execute request specifies a search query. Subsequently, an execute response is received from the search component. The execute response comprising latency data and one or more properties of query results. The latency data specifies an amount of time consumed by the search component to process the execute request. The query results are content items that satisfy the search query. A record object model latency request is sent to the search component. The record object model latency request specifies search performance information based on the latency data. A record interface latency request is sent to the search component. The record interface latency request specifies interface performance information based on an amount of time consumed by the first component to process the search request.

Abstract: A resource allocation system for a database environment. In a specific embodiment, the resource allocation system is adapted to implement a method that includes receiving a first signal from a user input device to identify a SQL SELECT statement to be used in a future database query. The system receives a second signal from the user input device to determine a resource to be used when the SELECT statement is executed. The system then stores, in a storage device, an indication of the resource in association with the SELECT statement so that when the SELECT statement is executed the resource is used.

Abstract: The present invention provides a method and system for optimizing search result rankings through use of a game interface. The method and system includes providing a game interface to at least two users, the game interface comprising at least one search query and at least two search result sets. The method and system further includes detecting the selection of one of the two search result sets by the users based on competition criteria and updating ranking data in response to the selection of one of the two search results. The method and system further includes selecting ranking data associated with a given query, determining an optimum ranking based on aggregating the selected ranking data, and storing the optimum ranking.

Abstract: The disclosed embodiments provide a system that determines whether to dynamically replicate data segments on a node in a computing cluster that stores a collection of data segments. During operation, the system identifies a data segment from the collection that is predicted to be frequently accessed by future tasks executing in the cluster. The system then determines a slowdown that would result for the current workload of the node if the data segment were to be replicated to the node. The system also determines a predicted future benefit that would be associated with replicating the data segment to the node. If the predicted slowdown is less than the predicted future benefit, the replication system replicates the data segment to the node.

Abstract: Apparatus, systems, and methods may operate to retrieve at least a portion of a first database query plan comprising a first tree and at least a portion of a second database query plan comprising a second tree. Further activities may include comparing relations and operations in the first tree and the second tree to identify differences. The differences may be found in the join order of the relations, and/or deleted, inserted, updated, or swapped ones of the operations based on operation signatures. Potential regression in query plan performance based on the differences may be indicated using a visual and/or audible alarm, and the differences may be published. Additional apparatus, systems, and methods are disclosed.

Abstract: An optimizer uses comprehensive reasoning regarding partitioning, sorting, and grouping properties for query optimization. When optimizing an input query expression, logical exploration generates alternative logical expressions. Physical optimization explores physical operator alternatives for logical operators. Required partitioning, sorting, and grouping properties of inputs to physical operators are determined. Additionally, delivered partitioning, sorting, and grouping properties of outputs from physical operators are determined. In some embodiments, enforcer rules are employed to modify structural property requirements to introduce alternatives for consideration. Property matching identifies valid execution plans in which the delivered partitioning, sorting, and grouping properties satisfy corresponding required partitioning, sorting, and grouping properties. An execution plan having the lowest cost is selected as the optimized execution plan.

Abstract: Managing a relationship between an organization and clients of the organization based on data stored on a server by the organization includes determining that data stored on the server represents a prospective interaction between a member of the organization and a client of the organization, searching the server for additional data related to the client of the organization, and providing a suggestion for optimizing the interaction to at least the member, the suggestion being based on a logical deduction made from the data representing the interaction and the additional data returned as a result of the searching.

Abstract: Usage patterns of structure model are utilized to determine a personalized structure model associated with a user. The personalized structure model is constructed such that retrieval of data associated with the personalized structure model is expected to improve performance of retrieving data from the data provider. The personalized structure model may be arranged based on an order of retrieval, based on groups of structure objects that may be retrieved together or the like. The personalized structure model may be a flat structure model to further improve performance of retrieving data from the data provider.

Abstract: Techniques for dividing a travel query into sub-queries for execution by a travel planning system is described. The techniques can divide the travel query according to some optimization such as by taking query processing difficulty into consideration or loading on the travel planning system.

Abstract: A system and method for managing media advertising enterprise data including a process for learning enterprise data matching. An EDM (Enterprise Data Management) application module can be configured to include a set of rules at an enterprise level to manage disparate and disconnected records associated with an entity. A number of unmatched and enterprise entities that matches with respect to an active entity can be returned based on a fuzzy logic associated with various matching options stored in an EDM database. A matching process can then be performed to accurately match similar records regardless of manual input, location, and format of the records in a distributed system. Each unmatched record can then be assigned with a parent enterprise entity. Such an optimization mechanism can interactively manage and report records at the enterprise level in a simple and efficient manner.

Abstract: A method of analyzing the performance of a query optimizer includes identifying an event trigger. A reproduction object characterizing operational parameters of the customer computer at the time of the event trigger is populated. The reproduction object is transported from the customer computer to a test computer. The reproduction object is analyzed at the test computer to characterize the performance of a query optimizer.

Abstract: Systems and methods to identify synonyms are described. The system generates demand information based on a first plurality of queries. Further, the system identifies a second plurality of queries as a first cluster of queries from the first plurality of queries based on the demand information, and identifies a first synonym set based on an association map that comprises a first plurality of constraints identified from the second plurality of queries. Finally, the system stores the first synonym set in a synonym dictionary.

Abstract: There is provided a computer-implemented method of executing a query. An exemplary method comprises optimizing the query. The query may specify multiple operations on corresponding multiple column sets of a table in a database. The exemplary method further comprises partitioning data of the table based on the operations within a single pass of the table. Additionally, the exemplary method comprises performing the operations on the partitioned data in parallel.

Abstract: Embodiments of the present disclosure include methods (and corresponding systems and computer program products) that augment visual elements in documents with rich media content and provide the rich media content based on user interaction with the augmented visual elements in the documents. The disclosed embodiments analyze a document for qualified visual elements. The disclosed embodiments determine keywords associated with the visual element, generate an association of the visual element and the keywords, and embed the association in a corresponding augmented document. When a user reviews the augmented document in a client system and moves a pointer over the augmented visual element, a piece of rich media content related to the keywords are transmitted to the client system to be displayed as an overlay in close proximity to the visual element where the mouse-over occurred.

Abstract: A method of locating nearby low priced items by utilizing a personal navigation device includes entering a shopping list of items a user wishes to buy through a user interface of the personal navigation device, the personal navigation device searching for each item on the shopping list in a database containing product price data and corresponding location data of stores selling one or more items on the shopping list, and the personal navigation device displaying search results for items on the shopping list that are found in the database, the search results including the price of the items and locations at which corresponding stores are located.

Abstract: A system facilitates automatically determining the hypothetical context information or the distribution of hypothetical contexts. During operation, the system receives a request from a user for one or more recommendations. The system also receives a current context substantially associated with the request. The system then determines a hypothetical context for the request, wherein the hypothetical context may be determined by considering several sources of information, including but not limited to the current context, past contexts, and relationships between the current context and past contexts. Next, the system determines one or more recommendations for the user based on the hypothetical context. Finally, the system returns the one or more recommendations to the user.

Abstract: This disclosure relates to systems, methods, and software that involve location-independent execution of user interface operations. This execution can include identifying a user interaction through a client-side user interface that is communicably coupled with a server-side computer. It is then dynamically determined whether to process the identified user interaction on the client-side or the server-side. If the user interaction is to be processed on the client-side, then a client-side action handler is invoked. If the user interaction is to be processed on the server-side, then it is requested that a server-side action handler process the interaction.

Abstract: Various systems and methods for prioritizing data storage and distribution by a data prioritizer device are provided. For example, the data prioritizer device may receive from a consumer a registration that includes one or more record identifiers, which identify one or more data records in which the consumer is interested. The data prioritizer device may receive from a producer a data record identified by a record identifier and store the data record when the record identifier is among the one or more record identifiers, thereby storing the data record when the consumer has indicated an interest in the data record. The data prioritizer device may queue the data record in a consumer queue allocated for the consumer and provide the data record to the consumer from the consumer queue.

Abstract: An intelligent caching system is described herein that intelligently consolidates the name-value pairs in content requests containing query strings so that only substantially non-redundant responses are cached, thereby saving cache proxy resources. The intelligent caching system determines which name-value pairs in the query string can affect the redundancy of the content response and which name-value pairs can be ignored. The intelligent caching system organically builds the list of relevant name-value pairs by relying on a custom response header or other indication from the content server. Thus, the intelligent caching system results in fewer requests to the content server as well as fewer objects in the cache.

Abstract: A method and apparatus for processing at least one data stream are disclosed. For example, the method receives at least a join query for the at least one data stream, wherein the join query specifies a lifetime for keeping a tuple as a marker for a beginning of a sequence of interest, and receives a tuple from the at least one data stream. The method marks the tuple as a beginning of a sequence of interest and stores the tuple, if the tuple is the beginning of the sequence of interest. The method applies one or more initial predicates to the tuple, and determines if the tuple matched a marked tuple, if the tuple meets the one or more initial predicates. The method determines if the tuple meets one or more conditions to be outputted, if the tuple meets the one or more initial predicates conditions.

Abstract: Embodiments described herein are directed to forming information units. Digital documents associated with collaborative navigation behavior information can be identified and an information unit can be generated using transition probabilities calculated from collaborative navigation information. The information unit including at least a subset of the digital documents identified in the collaborative navigation behavior information. A rank of information unit based on the collaborative navigation behavior information can be calculated.

Abstract: Techniques are disclosed for optimizing queries to hierarchically structured data. For example, a method for processing a query directed to data having a hierarchical structure with a plurality of data nodes comprises the following steps. One or more structural attributes describing the hierarchical structure of the data are identified. The query is partitioned into two or more query partitions using at least one of the one or more identified structural attributes. A parallel execution plan is determined for the query by splitting into components one or more of: the query into at least two of the query partitions; and the hierarchical structure of the data. The split components are executed in parallel on different computer processes according to the parallel execution plan.

Abstract: Users are enabled to perform tasks such as creating new content, searching for items, communicating with other users through a simplified access interface, at the same time defining a location for the access interface. A user may begin typing at any location on a canvas. The system ranks possible outcomes, suggesting one as the best match, where the user can override that choice upon which the resulting action is displayed at the point the input was initially placed. The user may be provided options to select among available tasks and the tasks may be performed without selecting an application.

Abstract: Search and advertising systems may be optimized through the use of user feedback. Selected parameters such as ranking, filtering, placement, and pricing may be optimized to achieve certain objectives. The optimization may include real-time user monitoring of multiple configurations with various parameters. In one embodiment, a subset of user queries may be assigned to a particular configuration for monitoring and measuring the real-time performance of that configuration. The performance for multiple configurations may be used to identify optimal settings.

Abstract: Systems and methods for SQL query load balancing are disclosed. A method may include establishing a ranking scheme, assigning a rank to an SQL query from the ranking scheme based on a plurality of rank assignment parameters, determining a threshold rank based on a plurality of gathered operational characteristics, comparing the assigned rank to the threshold rank, and, if the assigned rank is greater than the threshold rank, executing the SQL query on a database server. Otherwise, if the assigned rank is not greater than the threshold rank, executing the SQL query on a centralized storage system.

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 device and method for reusing user-specified content is provided. After generation of a query comprising parameters explicitly set by the user, the explicitly set parameters are stored in a parameter store. If a subsequent query is generated without any explicitly set parameters, the stored parameters are automatically applied to the subsequent query, and the modified query is then transmitted to an online service, such as an e-commerce site or search engine. User query preference history may be stored for use in modifying a subsequent theory. In addition, the user may navigate to specially designated content on a page, and when the content is in focus, the user may optionally copy the content for reuse in generating a further query or for publication.

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.