Abstract: More efficient querying of a multi-tenant database using dynamic tuning of database indices. A layer of meta-data associates data items with tenants, e.g., via tags, and the meta-data is used to optimize searches by channeling processing resources during a query to only those pieces of data bearing the relevant tenant's unique tag.

Abstract: A database restructuring support system that enables a user to flexibly design the structure of a database after a restructure. A storage cost estimate unit 112 calculates storage cost before and after restructure by using catalog information included in a database 122. In the case of calculating the storage cost of the restructure, tuples of a new schema is calculated and the storage cost is calculated by using the tuples. The access cost estimate unit 113 uses the catalog information and the log DB 121 included in the database 122 to calculate each access cost before and after restructure. In the case of calculating the access cost after restructure, the number of types of values of an attribute in the new schema is calculated to calculate the access cost by using the number of types. The integrated cost estimate unit 111 calculates the integrated cost by integrating the access cost and the storage cost.

Abstract: More efficient querying of a multi-tenant database using dynamic tuning of database indices. A layer of meta-data associates data items with tenants, e.g., via tags, and the meta-data is used to optimize searches by channeling processing resources during a query to only those pieces of data bearing the relevant tenant's unique tag.

Abstract: A method and apparatus are provided for enhancing search results generated by a search engine. A graphical user interface may display search results, which may include at least one multi-part record comprising a plurality of independent documents. Upon receiving a selection of the multi-part record from the search results a detailed view of the record may be displayed. The detailed view of the record may include a listing of the multiple documents that form the record along with an indication of whether keywords from the search criteria are present in the documents. By providing an indication of exactly which documents of a multi-part record include keywords associated with a search, embodiments of the invention allow users to easily identify desired materials from a list of search results comprising the multipart record.

Abstract: Various exemplary embodiments disclose an apparatus and method for generating a database that maps metadata to peer-to-peer (P2P) content and, more particularly, to a database that an Internet Service Provider (ISP) can build to correlate metadata with P2P traffic. The database may collect metadata having a key that uniquely corresponds to particular P2P content. An ISP may use the database to identify malware in P2P files and tag P2P traffic that seeks to exchange material in violation of applicable copyright laws.

Abstract: Application launching on a computer via indexed data. Based on a search term entered by a user, the computer searches an index containing metadata representative of one or more applications installed on the computer. A user interface on the computer's display has a window for displaying the results of searching the index. In addition, the user interface receives user input to select an application from the search results to be initiated. The computer is responsive to the user input via the user interface for initiating the selected application installed on the computer. A computer-readable medium including a persistent component, an index component, a query component, and an execution component embodies further aspects of the invention.

Abstract: A computer performed method models a spatial index having n spatial regions defined in a multidimensional space using a tree-based model representing an infinite number of arrangements of n spatial regions in the multidimensional space allowable by the spatial index using a finite number of tree representations, computes an average retrieval complexity measure for content retrieval using the spatial index based on the tree based model, and provides a spatial index recommendation based on the average retrieval complexity measure. In some embodiments a spatial index selection module selects the spatial index based on average retrieval complexity measures for candidate spatial indices that are functionally dependent upon a number of spatial regions to be defined by the spatial index.

Abstract: Methods and systems are provided that may be used to selectively decode results in messages received from child nodes for a particular search query.

Abstract: In one implementation, a method is provided for increasing relevance of database search results. The method includes receiving a subject query string and determining a trained edit distance between the subject query string and a candidate string using trained cost factors derived from a training set of labeled query transformations. A trained cost factor includes a conditional probability for mutations in labeled non-relevant query transformations and a conditional probability for mutations in labeled relevant query transformations. The candidate string is evaluated the for selection based on the trained edit distance. In some implementations, the cost factors may take into account the context of a mutation. As such, in some implementations multi-dimensional matrices are utilized which include the trained cost factors.

Abstract: A method of ranking documents by specificity values includes specifying a reference set of documents, each document including one or more terms, and specifying a first document that includes one or more terms that are included in the reference set of documents. The method includes determining, from the reference set of documents, one or more term-specificity values for the one or more terms of the first document by calculating frequencies of terms within the reference set of documents, wherein a larger term-specificity value corresponds to a lower likelihood relative to the reference set of documents, and determining a document-specificity value for the first document by combining the one or more term-specificity values for the first document, wherein larger term-specificity values correspond to a larger document-specificity value.

Abstract: A method for using dual indices to support query expansion, relevance/non-relevance models, blind/relevance feedback and an intelligent search interface, comprising using a computing device (89) to: access (101) an inverted index (103) to obtain an initial retrieval of results in response to a query, and to generate a rank list of the results, the results referring to information units (IUs) where the query occurs; and determine (105) a number of “N” IUs in the results that are assumed to be relevant by accessing a forward index (104); wherein the forward index (104) and inverted index (103) have pointers to locations in the IUs where terms of the query occur, and the forward index (104) retrieves a term frequency vector of the IU or a set of contexts of the IU.

Abstract: A method is disclosed for expansion of rare queries to improve advertisement results, including receiving a query from a user by a search engine; determining that the query does not match an entry in an ad query lookup table coupled with the search engine; retrieving one or more expanded queries located within a query feature index whose features relate to one or more features of the received query, wherein the query feature index includes a plurality of queries expanded based on at least corresponding search results; generating, in real time and by the search engine, an ad query including an expanded version of the received query based on features of the retrieved expanded queries; and selecting one or more advertisements based on the generated ad query, wherein the one or more advertisements are displayed to the user in response to the query received from the user.

Abstract: A method for generating and searching a ranged index provides a computer-readable medium which is adapted to store a database including a data chunk, and a ranged index including a data chunk index; generating the data chunk index by determining a high value in the data chunk and a low value in the data chunk; generate the ranged index from such data chunk index; and storing the ranged index on the computer-readable medium. A search value or values may then be provided; comparing the search value or values to the high value and the low value from the data chunk index for the data chunk in the ranged index for the database; and searching the data chunk to determine if the search value or values is lower than or equal to the high value and higher than or equal to the low value. By using inexpensive, quick comparisons of minima and maxima, the method and computer-program product avoids more costly sequential searches of larger data chunks where possible.

Abstract: Systems and methods for providing a thematic playback experience in a peer-to-peer media recommendation system are disclosed.

Abstract: Computer-implemented systems and associated operating methods use performance maps created by evaluating robustness of a database operator, query plan, or query to analyze health of a currently-executing query. The computer-implemented system comprises logic that receives one or more robustness maps of measured database system performance acquired during database execution in a predetermined range of runtime conditions. The logic analyzes state of a currently-executing query by locating the query's performance on the robustness maps.

Abstract: Candidate service providers for a desired service are ranked. Terms describing service requirements for a desired service are determined. Service capability documents describing the services of the candidate service providers are determined using the terms describing the service requirements. Using singular value decomposition (SVD) and a metric, similarities between the terms describing the service requirements and the service capability documents are determined. The candidate service providers are ranked based on the similarities.

Abstract: Computer-implemented systems and associated operating methods use atomic query maps to identify and evaluate database query plan robustness landmarks. The computer-implemented system comprises logic that evaluates robustness of a selected atomic query by measuring performance of atomic query execution in a predetermined range of runtime conditions that include data characteristics. The logic produces a set of measurements that can be displayed as one or more performance maps and analyzes the measured performance to identify landmarks indicative of database atomic query performance degradation greater than a predetermined amount.

Abstract: A system and method for automated search which may allow users to program their mobile devices to automatically bring up search results when a user or his mobile device meets a certain set of spatial, temporal, activity, or social context conditions.

Abstract: A system and method which may allow a requester to post a search query and get time-sensitive responses from other users who are best suited to respond to the search query. The system may find out such best suited responders based on their location, activity and time affinity/proximity to the search query, and forward the search query to them. The system may then return the responses to the requester. The system may also be able to automatically answer search queries based on users' historical query-response activities. By matching a search query with users knowledgeable about it, the invention may help a requester to get timely and accurate responses to his search query.

Abstract: Computer-implemented systems and associated operating methods take measurements and landmarks associated with robustness maps and perform tests evaluating the robustness of a database engine's operator implementations and/or query components. The illustrative computer-implemented system comprises logic that receives one or more robustness maps of measured database system performance acquired during database execution in a predetermined range of runtime conditions and uses information from the robustness map or maps to perform regression testing wherein landmarks in the robustness maps are operated upon as a robustness bugs describing conditions under which a predetermined implementation of a database operator or query component degrades in a manner different from a predetermined expected manner.

Abstract: A system and method for improved search relevance using proximity boosting. A query for a web search is received from a user, via a network, wherein the query comprises a plurality of query tokens. One or more concepts are identified in the query wherein each of concepts comprises at least two query tokens. A relative concept strength is determined for each of the identified concepts. The query is then rewritten for submission to a search engine wherein for each of the one or more concepts, a syntax rule associated with the respective relative concept strength of the concept is applied to the query tokens comprising the concept such that the rewritten query represents the one or more concepts whereby the proximity of the one or more concepts in a search result returned by the search engine to the user in response to the rewritten query is boosted.

Abstract: Aspects of the invention relate to a method and system to manage a business process and business process content, comprising a content management system that includes efficiency-improving and workflow features. Efficiency-improving features allow several people involved in a business process, including those residing in different locations, to store and access documents in a central repository of a content management system. Further, these features manage business process content that include functions such as document handling and searching capabilities that allow users to navigate, search, and develop business content efficiently. In addition, the business process becomes a virtual electronic environment without the need for redundant physical files spread throughout different offices.

Abstract: Methods of providing a document relevance score to a document on a network are disclosed. Computer readable medium having stored thereon computer-executable instructions for performing a method of providing a document relevance score to a document on a network are also disclosed. Further, computing systems containing at least one application module, wherein the at least one application module comprises application code for performing methods of providing a document relevance score to a document on a network are disclosed.

Abstract: The present invention provides techniques for managing a multi-tenant database system. In one embodiment the method includes providing access to data stored in a multi-tenant data structure that is implemented by storing data for multiple tenants on a pool of computer servers defining the multi-tenant data structure that having a plurality of data columns and one or more index columns. The one or more index columns define a first data field for a first tenant of the multi-tenant data structure and a second data field for a second tenant of the multi-tenant data structure. The first field indicates a first data type and the second field indicates a second data type, wherein the second data type is different than the first data type. Once created, records having data values in the first and second fields are stored to a single column in the data structure. The single column includes data values having different data types for different tenants in the multi-tenant data structure.

Abstract: Embodiments of the present invention are directed to query-optimization methods and systems that employ risk premiums assigned to database operations in order to increase the robustness and reliability of the evaluation and selection of query-execution plans for executing high-level database queries. Using risk-premium estimates, selection of query-execution plans that include potentially inefficient database operations and inefficient database-operation-execution sequences, often selected by currently available query-optimization methods and systems, are avoided.

Abstract: A system and method for ranking web searches with quantified semantic features. A query for a web search is received from a user. The query is segmented and tagged into one or more linguistic segments using linguistic analysis. At least some of the linguistic segments are tagged with a linguistic type. A query execution plan is generated comprising the linguistic segments and, for each of the linguistic segments tagged with a linguistic type, at least one tag attribute comprising at least one domain specific feature of the linguistic type. A search is performed for documents matching the query. Each of the documents is scored for each of the linguistic segments of the query execution plan using the tag attributes of the respective linguistic segment. The documents are ranked using a function that uses the scores of the documents. A ranked list of the documents is transmitted back to the user.

Abstract: Disclosed herein are one or more embodiments that facilitate selection of keywords for bidding by an advertiser having a website. One or more of the disclosed embodiments may process a click-through log to determine measures of competitiveness for a plurality of websites extracted from the click-through log. Also, the one or more disclosed embodiments may, for one of the websites, determine a ranking of competing websites based at least in part on the measures of competitiveness. The ranking of competing websites may be used to facilitate selection of keywords for bidding.

Abstract: Example methods and apparatus to collect broadband market data are disclosed. A disclosed example method includes selecting a panelist household, the panelist household subscribing to at least one broadband service delivered via a modem, and identifying an Internet protocol (IP) address assigned to the modem by an Internet service provider (ISP). The example method also includes retrieving a range of IP addresses associated with the ISP, selecting a random subset of IP addresses from the range of IP addresses, and testing each of the IP addresses from the random subset to determine an activity status of each IP address.

Abstract: The invention provides a computer-based method of determining target subset of data based on measured parameter comprising (i) storing a set of keyword phrases in at least one computer-readable storage medium, (ii) storing a set of measured parameters in said at least one computer-readable storage medium, each measured para meter being associated with a respective one of the keyword phrases, (iii) receiving at least one common sub phrase in at least one computer processor connected to said at least one computer-readable storage medium due to entry of said sub phrase by a user utilizing a computer input device connected to the computer processor, (iv) operating said at least one computer processor to extract a subset of keyword phrases having the common sub phrase from the keyword phrases, (v) operating said at least one computer processor to aggregate the extracted keyword phrases to determine a total measured parameter for each extracted keyword phrase, each total measured parameter being a function of the m

Abstract: Methods, systems, and computer program products are provided for performing structured parallel data intensive computations. A SQL-FCF framework that defines a SQL construct based interface for performing the computations is provided. The computations within an application are coded as table valued functions (TVFs). Data for the application is partitioned into data partitions to co-locate and load balance the data partitions and corresponding computations. The TVFs are invoked and applied to corresponding ones of the data partitions in a structured order defined by function control forms (FCF).

Abstract: Tools and techniques for indexing and querying data stores using concatenated terms are provided. These tools may receive input queries that include at least two query terms. The query terms are correlated respectively with fields contained within records within a data store, with these fields being populated with respective field values. The query terms are arranged according to an indexing priority according to which the fields are ranked within an indexing table, which is associated with the data store. The tools then concatenate the query terms as arranged according to the indexing priority.

Abstract: A system and method for determining a similarity between a document and a query includes providing a frequently used dictionary and an infrequently used dictionary in storage memory. For each word or gram in the infrequently used dictionary, n words or grams are correlated from the frequently used dictionary based on a first score. Features for a vector of the infrequently used words or grams are replaced with features from a vector of the correlated words or grams from the frequently used dictionary when the features from a vector of the correlated words or grams meet a threshold value. A similarity score is determined between weight vectors of a query and one or more documents in a corpus by employing the features from the vector of the correlated words or grams that met the threshold value.

Abstract: A computer implemented method, a computer program product, and a data processing system for presenting search results in the context of a table-of-contents. A keyword search term and a stratum-level are identified. An occurrence of the keyword search term is then identified from a searched document. The occurrence of the keyword search term is then presented within a context of a table-of-contents of the searched document, wherein the occurrence of the keyword search term is presented according to the indicated stratum-level.

Abstract: An aggregate ranking model is generated, which comprises a general ranking model and one or more topical training models. Each topical ranking model is associated with a topic, or topic class, and for use in ranking search result items determined to belong to the topic, or topic class. As one example, the topical ranking model is trained using a set of topical training data, e.g., training data determined to belong to the topic, or topic class, a general ranking model and a residue, or error, determined from a general ranking generated by the general ranking model for the topical training data, with the topical ranking model being trained to minimize the general ranking model's error in the aggregate ranking model.

Abstract: Techniques for database rule ordering and processing are provided. Structured Query Language (SQL) statements are iterated to identify processing dependencies and a processing order is generated. The SQL statements are automatically modified to enforce the processing order and the modified SQL statements are executed against a database.

Abstract: Systems and methods for managing versions of product attribute information are described with respect to a number of embodiments of the present disclosure. In one implementation, a database management system that manages a database for storing attribute information of a product is described. The database management system in this implementation comprises a version control system and a querying system. The version control system is configured to enable a user to insert one or more versions of product information in the database. Each version has an effective date and is divided into a plurality of attribute groups, each attribute group containing a plurality of attributes. One or more attribute groups are modified with respect to a previous version. The version control system is further configured to record which attributes of a modified attribute group are changed. The querying system is configured to enable a user to search the database based on the effective dates of the versions.

Abstract: The database command rewriting system rewrites a first database command that includes language specific for a first database management system command into a second database command suitable for a second database management system. The database command rewriting system receives the first database command and identifies the specific language. Furthermore, the database command rewriting system retrieves a rule based on the identified language. Using the retrieved rule, the database command system rewrites the first database command to the second database command and transmits the second database command to the second database management system.

Abstract: Systems and methods for personalized media recommendation are provided. One example system may include a media server including a media database containing a plurality of media tracks and a database schema defining multiple media styles. The media server may further include a media delivery engine configured to transmit media tracks to each of a plurality of media clients. The system may further include a feedback module configured to receive history data from each of the media clients. Further still, the system may include a recommendation engine configured to compute a plurality of user-specific style weights, and to select one or more recommended media tracks for each user, The recommendation engine may be further configured to send a recommendation message to the media client including media links to the recommended media tracks on the media server, to cause the media client to display the media links to a user.

Abstract: Techniques are provided for searching within a collection of XML documents. A relational table stores an entry for each node of a set of nodes in a collection of XML documents. Each entry of the relational table stores an order key and a path identifier along with the atomized value of the node. Instead of storing the atomized value in a full-text index, a virtual column can be created to represent, for each node, the atomized value of the node. Alternately, each entry of the relational table stores an order key and a path identifier along with, for simple nodes, the atomized value, and for complex nodes, a null value. For a complex node with a descendant text node, a separate entry is stored for the descendant text node in the relational table.

Abstract: A system and method of software database tracking design encompasses user, commercial user, professional and novice researcher usage of the internet on database systems located locally on hard-drives or remotely on servers through internet protocol design computers and storage systems alike IP telephony, mobile phones, mobile system storage devices and average home and laptop computers via software installation or as alternate service providers to emulate small as well as large command demand URL files upon objects, through menus, or display directly on a location on a website to dedicate to the user's need and demand for a high-grade interoperability of usage of tracking their movements on the internet both as point to point landing pages including objects as precisely offering step by step user's usage in a functioning internet environment including some cases of expertly delivering advertisements.

Abstract: A method and system for filtering medical information in emergency situations are provided. The method includes receiving information relating to an emergency in which a person needs medical help, the information including: details of the type of emergency; and details of a care providing person aiding the person needing help. The method includes obtaining medical information relating to the emergency which may include information relating to the medical condition and/or medical records of the person. The level of medical expertise of the care providing person is determined and the medical information is filtered to provide the medical information appropriate to the level of medical expertise of the care providing person.

Abstract: A method and a system are provided for large-scale behavioral targeting for advertising over a network, such as the Internet. In one example, the system receives training data that is processed raw data of user behavior. The system generates selected features by performing feature selection on the training data. The system generates feature vectors from the selected features. The system initializes weights of a behavioral targeting model by scanning the feature vectors once. The system then updates the weights of the behavioral targeting model by scanning iteratively the feature vectors using a multiplicative recurrence.

Abstract: An apparatus and method to optimize a query access plan in a computer database system. In preferred embodiments, the query optimizer determines the query can be optimized and generates for the query an optimized access plan that eliminates records defined by a Where clause and one or more ordering criteria prior to ordering the records (sorting or grouping) and then returning a first n rows.

Abstract: Techniques for independent column detection in selectivity estimations are provided. Values for database statistics are sampled and two independent tests are performed against the values for a first column and a second column. When each test determines that the first and second columns are independent, the first and second columns are said to be independent columns for selectivity estimation.

Abstract: A stay location connection information register device retains history information including user information and stay location information. A history information searching unit searches history information coincident with a predetermined condition. A stay location connection information generating unit generates link information of the stay location by the unit of the user information with using the history information searched by the history information searching unit. Then, the stay location connection information register unit registers the stay location connection information. In this manner, since the stay location connection information register device generates the link information of the stay location with using the history information, the stay location connection information register device can define a correspondent relation between the stay locations.

Abstract: Systems and methods are provided to evaluate a search engine using search results retrieved from a plurality of different search engines. For example, a controller can randomly distribute a set of pre-formulated queries to a plurality of computers to query the search engines at random times to obtain search results and combine the search results to evaluate the completeness of a query result provided by a particular search engine. The controller may simulate the random queries from users using a set of computers and may reduce the burden on the search engines by spreading out the query activities over a period of time, such as a month.

Abstract: A computer-implemented method that inputs a confirmed social network of a user, performs data mining of electronically accessible data for the user to produce a mined social network including individuals having a social relationship with the user and having an electronically accessible link to the user, subtracts the confirmed social network of the user from the mined social network to produce a recommendation list, in which the recommendation list includes at least one new individual not belonging to the confirmed social network of the use, and in which the recommendation list recommends the at least one new individual not belonging to the confirmed social network for membership in the confirmed social network, and outputs the recommendation list to the user.

Abstract: A system for personalization of a search engine for a network includes a least one search account. A first data structure stores index data for words each having a number of resources less than a first number. A second data structure stores index data for words each having a number of resources greater than the first number and less than a second number. The second data structure can be personalized for the search account. A third data structure stores index data for words each having a number of resources greater than the second number. The third data structure can be personalized for search account. At least one index includes the first data structure, the second data structure and the third data structure where when the search engine responds to a query from a user of a search account, the search engine uses an index corresponding to the search account.

Abstract: Methods and systems such as those described herein include accepting input, identifying CYP450-family enzymes, identifying at least one modulator of an enzyme, and communicating one or more treatments to a system user.

Abstract: Effectiveness of keywords is determined. The keywords are classified to include effective keywords and ineffective keywords. An exclusion keyword list based on ineffective keywords is created. The ineffective keywords that conflict with the effective keywords are removed from the exclusion keyword list. Negative keywords are determined.