Patent application number | Description | Published |
20090313238 | SEARCH INDEX FORMAT OPTIMIZATIONS - A search index structure which extends a typical composite index by incorporating an index which is optimized for fast retrieval from storage and which eliminates data which is specific to phrase searching. Other data is represented in a manner which allows it to be calculated rather than stored. Associating variable length entries with logical categories allows their length to be inferred from the category rather than stored. Using delta values between document IDs rather than the ID itself generates a compact, dense symbol set which is efficiently compressed by Huffman encoding or a similar compression method. Using an upper threshold to remove large, and thus rare, delta values from the symbol set prior to encoding further improves the encoding performance. | 12-17-2009 |
20090327266 | Index Optimization for Ranking Using a Linear Model - Technologies are described herein for providing a more efficient approach to ranking search results. One method reduces an amount of ranking data analyzed at query time. In the method, a term is selected, at index time, from a master index. The term corresponds to a number of documents greater than a threshold. A set of documents that includes the term is selected based on the master index. A rank is determined for each document in the set of documents that contains the term. Each document in the set of documents that contains the term is assigned to a high ranking index or a low ranking index based on the simple rank. | 12-31-2009 |
20100121838 | INDEX OPTIMIZATION FOR RANKING USING A LINEAR MODEL - Technologies are described herein for providing a more efficient approach to ranking search results. An illustrative technology reduces an amount of ranking data analyzed at query time. In the technology, a term is selected, at index time, from a master index. The term corresponds to a number of documents greater than a threshold. A set of documents that includes the term is selected based on the master index. A rank is determined for each document in the set of documents that contains the term. Each document in the set of documents that contains the term is assigned to a top document list or a bottom document list based on the rank. Predefined values of at least part of the rank are stored in the top document list for documents in the top document list and are not stored in the bottom document list for documents in the bottom document list. | 05-13-2010 |
20100191707 | TECHNIQUES FOR FACILITATING COPY CREATION - Various techniques are disclosed for creating a snapshot of application data. A snapshot is taken by pausing parts of the application over time. Modifications are paused to a first part of data and the first part is copied into a snapshot. After the first part has finished copying, modifications are paused to remaining data, and the remaining data is copied. The application is unpaused. A snapshot can be taken by unpausing parts of the application over time. Modifications to data in an application are paused. A first part of data is copied, and after the first part has finished copying, modifications to the first part are unpaused. The final part of data is copied, and after the final part has finished copying, modifications to the final part are unpaused. Techniques for creating a snapshot of data residing in multiple locations are described. | 07-29-2010 |
20120158748 | RANKING REAL ESTATE BASED ON ITS VALUE AND OTHER FACTORS - Real estate ranking computation is calculated to sort real estate properties. Such computations use available information regarding real estate properties in any local markets and may help the real estate buyer to identify real estate properties with various ranked financial values. Suitably, a relatively small geographic area can be used based on the real estate buyer's specified criteria, and the real estate ranking computation is able to handle interactions among predictor variables, possesses suitable predictive confidence, and includes the capability for dynamically adjusting the underlying ranking computation as new patterns of real estate market emerge over time. | 06-21-2012 |
20120179668 | SEARCH INDEX FORMAT OPTIMIZATIONS - A search index structure which extends a typical composite index by incorporating an index which is optimized for fast retrieval from storage and which eliminates data which is specific to phrase searching. Other data is represented in a manner which allows it to be calculated rather than stored. Associating variable length entries with logical categories allows their length to be inferred from the category rather than stored. Using delta values between document IDs rather than the ID itself generates a compact, dense symbol set which is efficiently compressed by Huffman encoding or a similar compression method. Using an upper threshold to remove large, and thus rare, delta values from the symbol set prior to encoding further improves the encoding performance. | 07-12-2012 |
20130110828 | TENANTIZATION OF SEARCH RESULT RANKING | 05-02-2013 |
20140074881 | TENANTIZATION OF SEARCH RESULT RANKING - This disclosure describes methods and systems for searching documents in a multi-tenant hosting environment. According to embodiments, to conserve hardware resources, a plurality of documents associated with a plurality of tenants may be mapped to the same search index in the multi-tenant hosting environment. In order to search documents associated only with a single tenant in the multi-tenant hosting environment, a tenant identifier is prepended to every key stored in the search index that is associated with the plurality of documents of the single tenant. Moreover, where one document links to another document within the multi-tenant hosting environment, the link is stored in a web graph when a source tenant identifier matches a target tenant identifier for the link. According to embodiments, when conducting a search, the link is resolved only if the link is stored in the web graph. | 03-13-2014 |
20150066899 | SEARCH INDEX FORMAT OPTIMIZATIONS - A search index structure which extends a typical composite index by incorporating an index which is optimized for fast retrieval from storage and which eliminates data which is specific to phrase searching. Other data is represented in a manner which allows it to be calculated rather than stored. Associating variable length entries with logical categories allows their length to be inferred from the category rather than stored. Using delta values between document IDs rather than the ID itself generates a compact, dense symbol set which is efficiently compressed by Huffman encoding or a similar compression method. Using an upper threshold to remove large, and thus rare, delta values from the symbol set prior to encoding further improves the encoding performance. | 03-05-2015 |