Source: http://www.google.com/patents/US8090698?dq=5,890,152
Timestamp: 2016-02-08 23:16:04
Document Index: 81285018

Matched Legal Cases: ['art 204', 'art 206', 'art 204', 'art 206', 'art 206', 'arts 204']

Patent US8090698 - Method and system to facilitate a search of an information resource - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inPatentsA method and system facilitate a search of an information resource. The system identifies data items within the information resource and determines a respective attribute value from each data item. The system analyzes the attribute values to identify a distribution of the data items based on a predetermined...http://www.google.com/patents/US8090698?utm_source=gb-gplus-sharePatent US8090698 - Method and system to facilitate a search of an information resourceAdvanced Patent SearchPublication numberUS8090698 B2Publication typeGrantApplication numberUS 10/841,583Publication dateJan 3, 2012Filing dateMay 7, 2004Priority dateMay 7, 2004Fee statusPaidAlso published asUS8954411, US20050251510, US20120095975, US20150154315Publication number10841583, 841583, US 8090698 B2, US 8090698B2, US-B2-8090698, US8090698 B2, US8090698B2InventorsEric Noel Billingsley, Louis Marcel Gino Monier, Aditya AroraOriginal AssigneeEbay Inc.Export CitationBiBTeX, EndNote, RefManPatent Citations (64), Non-Patent Citations (1), Referenced by (5), Classifications (10), Legal Events (3) External Links: USPTO, USPTO Assignment, EspacenetMethod and system to facilitate a search of an information resource
US 8090698 B2Abstract
A method and system facilitate a search of an information resource. The system identifies data items within the information resource and determines a respective attribute value from each data item. The system analyzes the attribute values to identify a distribution of the data items based on a predetermined range of attribute values that are associated with the first attribute and determines if the identified distribution of data items facilitates the search of the information resource.
1. A system to facilitate a search of an information resource, the system comprising:
at least one machine, the at least one machine respectively including a processor for executing:
an identifying module to identify a plurality of data items within the information resource;
an analyzing module to:
generate a plurality of attribute values, the plurality of attribute values including, for each data item of the plurality of data items, an attribute value that corresponds to an attribute that is associated with each of the plurality of data items; and
identify a distribution of the plurality of data items across the plurality of attribute values;
a determining module to:
register the distribution for communication based on a determination that the distribution facilitates a filtering of the plurality of data items, the determination based on the distribution being at least a bimodal distribution and a frequency of the plurality of data items for at least two of the plurality of attribute values in the distribution exceeding a threshold; and
a communication module to communicate the distribution as a graph that includes a plurality of components corresponding to the plurality of attribute values, and to receive a selection of at least one of the plurality of components to facilitate the filtering of the plurality of data items.
2. The system of claim 1, wherein each of the plurality of attribute values is a numeric attribute value or a text attribute value.
3. The system of claim 1, wherein the identifying module is to identify the plurality of data items based on at least one of a keyword request, a browse request or a first attribute.
4. The system of claim 1, wherein the distribution is based on a plurality of counts of the plurality of data items over a plurality of respective ranges of the attribute values.
5. The system of claim 1, wherein the determining module is to substitute a second plurality of sub-range attribute values for a first plurality of sub-range attribute values based on a determination that the second plurality of sub-range attribute values would better facilitate the filtering of the plurality of data items.
6. The system of claim 1, wherein the communication module is to communicate the distribution of the plurality of data items to the user.
7. The system of claim 1, wherein the communication module is to display to the user at least one of a histogram, a pie chart, or frequency values.
8. The system of claim 1, wherein the communication module is to generate a plurality of attribute selectors based on a plurality of distributions of the plurality of data items and to communicate the plurality of attribute selectors to the user.
9. The system of claim 1, wherein the plurality of data items are a plurality of listings in a network-based marketplace, and each listing of the plurality of listings comprises at least one of a group including an item listing or a service listing.
10. The system of claim 1, wherein the identification module is to identify the plurality of data items without a query to a database.
11. The system of claim 1, wherein the attribute is associated with each of the plurality of data items based on each of the plurality of data items being classified within a category.
12. The system of claim 1, wherein the attribute is associated with each of the plurality of data items based on the attribute being common to each of the plurality of data items.
13. The system of claim 1, wherein the plurality of attribute values is a plurality of sub-range attribute values or a plurality of exact-match attribute values.
14. A computer-implemented method to facilitate a search of an information resource, the method comprising:
identifying, by a processor, a plurality of data items within the information resource;
generating a plurality of attribute values, the plurality of attribute values including, for each data item of the plurality of data items, an attribute value corresponding to an attribute that is associated with each of the plurality of data items;
identifying a distribution of the plurality of data items across the plurality of attribute values;
registering the distribution for communication based on a determination that the distribution facilitates a filtering of the plurality of data items, the determination based on the distribution being at least a bimodal distribution and a frequency of the plurality of data items for at least two of the plurality of attribute values in the distribution exceeding a threshold;
communicating the distribution as a graph that includes a plurality of components corresponding to the plurality of attribute values; and
receiving a selection of at least one of the plurality of components to facilitate the search filtering of the plurality of data items.
15. The computer-implemented method of claim 14, wherein each of the plurality of attribute values is a numeric attribute value or a text attribute value.
16. The computer-implemented method of claim 14, wherein the identifying of the plurality of data items includes at least one of a group including identifying based on keyword request, a browse request, or a first attribute.
17. The computer-implemented method of claim 14, wherein the plurality of attribute values is a first plurality of sub-range attribute values or a plurality of exact-match attribute values.
18. The computer-implemented method of claim 14, further including substituting a second plurality of sub-range attribute values for the first plurality of sub-range attribute values.
19. The computer-implemented method of claim 14, further including communicating the distribution of the plurality of data items to a user.
20. The computer-implemented method of claim 19, wherein the communicating of the distribution of the plurality of data items to the user includes displaying to the user at least one of a group including a histogram, a pie chart, or frequency values.
21. The computer-implemented method of claim 14, further including generating a plurality of attribute selectors based on a plurality of distributions of the plurality of data items and communicating the plurality of attribute selectors to the user.
22. The computer-implemented method of claim 14, wherein the plurality of data items are a plurality of listings in a network-based marketplace, and each listing of the plurality of listings comprises at least one of a group including an item listing or a service listing.
23. The computer-implemented method of claim 14, wherein the identifying the plurality of data items is performed without querying a database.
24. A non-transitory machine readable medium storing a set of instructions that, when executed by the machine, cause the machine to:
identify a plurality of data items within the information resource;
generate a plurality of attribute values, the plurality of attribute values including, for each data item of the plurality of data items, an attribute value corresponding to an attribute that is associated with each of the plurality of data items;
register the distribution for communication based on a determination that the distribution facilitates a filtering of the plurality of data items, the determination based on the distribution being a least a bimodal distribution and a frequency of the plurality of data items for at least two of the plurality of attribute values in the distribution exceeding a threshold; and
communicate the distribution as a graph that includes a plurality of components corresponding to the plurality of attribute values; and
receive a selection of at least one of the plurality of components to facilitate the filtering of the plurality of data items.
25. A system to facilitate a search of an information resource, the system comprising:
a first means for identifying a plurality of data items within the information resource;
a second means for generating a plurality of attribute values, the plurality of attribute values including, for each data item of the plurality of data items, an attribute value that corresponds to an attribute that is associated with each of the plurality of data items; and
a third means for registering the distribution for communication based on a determination that the distribution facilitates a filtering of the plurality of data items, the determination based on the distribution being a least a bimodal distribution and a frequency of the plurality of data items for at least two of the plurality of attribute values in the distribution exceeding a threshold; and
a fourth means for communicating the distribution as a graph that includes a plurality of components corresponding to the plurality of attribute values, and receiving a selection of at least one of the plurality of components to facilitate the filtering of the plurality of data items.
An embodiment relates generally to the technical field of search automation and, in one exemplary embodiment, to a method and system to facilitate a search of an information resource.
A search engine is a tool that identifies data items in a database. A search engine will respond to a search request by returning search results that include such data items. Sometimes a search result will include a staggering number of data items all of which are responsive to the search request but most of which are not helpful. Indeed, finding a valuable data item in a large search result may sometimes be quite difficult. Often a user will manually process a set of data items to find a valuable data item by scanning multiple web pages of a search result and analyzing individual data items. Sometimes the number of data items prohibits manual processing by a user because the task cannot be completed in a reasonable amount of time.
A method to facilitate a search of an information resource includes, identifying a plurality of data items within the information resource and determining a respective attribute value corresponding to a first attribute for each data item to generate a plurality of attribute values. The plurality of attribute values are analyzed to identify a distribution of the plurality of data items based on a predetermined range of attribute values for the first attribute. A determination is made regarding whether the identified distribution of the plurality of data items facilitates the search of the information resource.
FIG. 1 is a network diagram depicting a system, according to one exemplary embodiment of the present invention;
FIG. 2 is a system that includes a search system, according to one exemplary embodiment of the present invention;
FIG. 3 is a block diagram illustrating a search engine, according to an exemplary embodiment of the present invention;
FIG. 4 is a block diagram illustrating a search index, according to an exemplary embodiment of the present invention;
FIG. 5 is a block diagram illustrating tables utilized by the search engine, according to an exemplary embodiment of the present invention;
FIG. 6 is a flow chart illustrating a method, according to an exemplary embodiment of the present invention, to facilitate a search of an information resource;
FIG. 7 is a flow chart illustrating a method, according to an exemplary embodiment of the present invention, for analyzing data items;
FIG. 8 is a flow chart illustrating a method, according to an exemplary embodiment of the present invention, for building hash tables;
FIG. 9 is a flow chart illustrating a method, according to an exemplary embodiment of the present invention, for determining if the identified distribution facilitates a search and communicating the identified distribution;
FIGS. 10-13 illustrate user interface screens, according to an exemplary embodiment of the present invention; and
FIG. 14 is a block diagram illustrating a trading system, according to an exemplary embodiment of the present invention;
FIG. 15 is a block diagram illustrating multiple marketplace and payment applications that, in one exemplary embodiment of the present invention, are provided as part of the network-based trading platform;
FIG. 16 is a high-level entity-relationship diagram, illustrating various tables that are utilized by and support the network-based trading platform and payment applications, according to an exemplary embodiment of the present invention; and
FIG. 17 illustrates a diagrammatic representation of a machine, in the exemplary form of a computer system, within which a set of instructions, for causing the machine to perform any one or more of the methodologies discussed herein, may be executed.
A method and system to facilitate a search of an information resource are described. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be evident, however, to one skilled in the art that the present invention may be practiced without these specific details.
In general, embodiments described below feature a system that facilitates a search of an information resource. The system receives a search request from a user and generates a search result by identifying data items that are responsive to the search request. Each data item in the search result may be characterized with one or more attributes. For example, a price, an author, or a subject may be attributes that characterize a book. Next, the system analyzes the attribute values of the data items to identify one or more distributions of data items. For example, three distributions of data items may be generated for a book based on the above-mentioned three attributes. A distribution may reflect a count of the number data items for a predetermined attribute value (e.g., for the attribute Author—Steinbeck, Poe, Twain, etc.) or range of attribute values (e.g., for the attribute price-$1.00 to $4.99, $5.00-$9.99, $10.00-$14.99 etc.). Next, the system determines which identified distributions may facilitate (or aid) additional searching of the information resource and which distributions may not facilitate additional searching. Distributions that do not facilitate additional searching may include for example a flat distribution, a distribution without modes or peaks or a single mode distribution. For example, an identified distribution for price may not facilitate additional searching because all of the books in the search result are in the same $5.00-$9.99 price range. Finally, the system may present one or more distributions that facilitate additional searching by displaying the distribution to the user in graphical or numeric form (e.g., histogram, pie chart, frequency counts, etc.). Other embodiments may display the distribution to the user as an attribute selector that enables the user to further filter the search results by selecting an attribute value (e.g., for the attribute Author—Steinbeck, Poe, Twain, etc.).
FIG. 1 is a network diagram depicting a system 10, according to one exemplary embodiment of the present invention, having a client-server architecture. A platform, in the exemplary form of an information storage and retrieval platform 12, provides server-side functionality, via a network 14 (e.g., the Internet) to one or more clients. FIG. 1 illustrates, for example, a web client 16 (e.g., a browser, such as the INTERNET EXPLORER browser developed by Microsoft Corporation of Redmond, Wash. State), and a programmatic client 18 executing on respective client machines 20 and 22.
Turning specifically to the information storage and retrieval platform 12, an Application Program Interface (API) server 24 and a web server 26 are coupled to, and provide programmatic and web interfaces respectively to, one or more application servers 28. The application servers 28 host one or more processing applications 30 and search applications 32. The application servers 28 are, in turn, shown to be coupled to one or more databases servers 34 that facilitate access to one or more databases 36.
The processing applications 32 provide a number of functions and services to users that access the information storage and retrieval platform 12. The search applications 30 likewise provide a number of search services and functions to users. The processing applications 32 allow users to add, delete and modify data items with respect to the databases 36. A data item may be any recognizable discrete unit of information including a document, a web page, a book, a service, a real estate parcel, etc. Each data item may be described by attribute values that may be numeric or text. For example, a numeric attribute for a book may include its price. The corresponding attribute value may include any one of a range of values (e.g., $1 to $5). An example of a text attribute for the book may include its title and the corresponding attribute value may include the string, “Palm Pilot”. The search applications 30 allow users to identify and display data items of interest.
Further, while the system 10 shown in FIG. 1 employs a client-server architecture, the present invention is of course not limited to such an architecture, and could equally well find application in a distributed, or peer-to-peer, architecture system. The various search and processing applications 30 and 32 could also be implemented as standalone software programs, which do not necessarily have networking capabilities.
The web client 16, it will be appreciated, accesses the various search and processing applications 30 and 32 via the web interface 26 supported by the web server 26. Similarly, the programmatic client 18 accesses the various services and functions provided by the search and processing applications 30 and 32 via the programmatic interface provided by the API server 24.
Search Architecture and Applications
FIG. 2 is a block diagram illustrating a search system 15 as embodied in the information storage and retrieval platform 12, according to an exemplary embodiment of the present invention. The search system 15 includes search system components located on or connected to the application servers 28 and the database servers 34.
A search request may take the form of a keyword request, an identification request or a browse request. A keyword request identifies data items that contain text with word(s) that match keyword(s) entered by a user. An identification request identifies a single data item that is identified by an identification number that is entered by the user. A browse request identifies data items according to various category, catalogue, or inventory data structures according to which data items may be classified within the information storage and retrieval platform 12. Associated with each of the above types of requests are filters that may be applied to the search result. A filter may be based on a numeric attribute value of a data item (e.g., price, quantity, size, etc.) or a text attribute value of a data item (e.g., color—red, green, blue; keywords, etc.).
The application servers 28 host a search engine 39 that includes a search index 17. The search engine 39 services search requests from users by returning search results that include one or more data items.
The database servers 34 support a database engine 27, a scrubber 35 and a search database engine 29. In addition, the database servers 34 provide connections to a search database 23 and a data item database 19.
The database engine 27 facilitates adding, updating, and deleting data items in the data item database 50. In addition, the database engine 27 may provide additional services including the storage and retrieval of currency exchange rates, category structures (e.g., listings are maintained in hierarchies of categories), zip code to regional identification maps and other information.
The scrubber 35 is used to normalize a data item. More specifically, the scrubber 35 may strip HTML tags from the description, convert text fields to Unicode, normalizes all date fields to a common date format, normalize all measurement units to a common measurement unit, and normalize all prices based on exchange rates to a common currency. For example, the scrubber 35 may convert the measurement unit of miles into kilometers. Another example may include converting Euros into US dollars. Similarly, the scrubber 35 may convert Greek letters, or the standard alphabet into a Unicode, such as UTF8. Normalization enables searching across a heterogeneous set of data items with a simplified search algorithm.
The search database engine 29 includes a publisher 33 and a full indexer 31. The publisher 33 is utilized for adding, deleting, and updating normalized listings both in the search database 23 and in the search index 17 in the search engine 39. The full indexer 31 generates and updates a complete search index 17 in the search engine 40 responsive to fragmentation of the search index 17 from the addition and deletion of listings or responsive to initializing of the search engine 39.
The components of the search system 15 may communicate with each other over a specialized message bus 37 that utilizes publish/subscribe middleware and database access software. In one embodiment the middleware may be embodied as TIBCO Rendezvous™, a middleware or Enterprise Application Integration (EAI) product developed by Tibco Software, Inc. Palo Alto, Calif.
The search system 15 optimally and efficiently responds to a search request by maintaining a normalized memory resident copy of all data items in the information storage and retrieval platform 12 in the search index 17. Thus, the search engine 39 may respond to a search request by accessing the memory resident search index 17 to obtain the requested data items without the performance penalty that comes from the processing overhead and delay associated with a database access. One example of the data flow necessary to maintain accurate data item information is described. In response to a user adding a data item, the database engine 27 updates the data item database 19 thereby triggering a publishing of the newly added data item to the scrubber 35. The scrubber 35 normalizes the data item by retrieving additional information from the data item database 19 including currency exchange rates, category structures, zip code to regional identification maps, etc. . . . The scrubber 35 stores the normalized data item in the search database 23 via the publisher 33, thereby triggering the publisher 33 to publish the normalized data item to the search index 17 in the search engine 39. A similar data flow will result from an update or deletion of a data item. It will be appreciated that the above described dataflow may also be invoked for every data item in the data item database 19 responsive to a currency exchange rate change, a category structure change, a zip code to regional mapping change, or any other modification which may require a reevaluation of the listing by the scrubber 35.
The other pathway between the search database 23 and the search engine 39 is via the full indexer 31. As described above, this path is utilized for a batch update of the search engine 39. The full indexer 17 retrieves data items from the search database 23, builds a new search index 17, and publishes the entire search index 17 to the search engine 39.
FIG. 3 is a block diagram illustrating an architecture of the search engine 39, according to an exemplary embodiment. The search engine 39 includes search tables 131, a search index 17, an identifying module 138, an analyzing module 140, a determining module 142 and a communication module 144.
The identifying module 130 receives a search request from a user and identifies data items. The analyzing module 140 builds hash tables, extracts attribute values from the data items and identifies a distribution of data items based on the extracted attribute values.
The determining module 142 examines previously constructed hash tables and determines if the identified distribution of data items in the hash table may facilitate (or aid) a user search of the information resource.
The communication module 144 communicates one or more distributions of data items to the user in the form of a histogram, a pie chart, or frequency values, for example. In other embodiments, the communication module 144 may utilize the identified distributions to select one or more attribute selectors for communication to the user.
FIG. 4 is a block diagram illustrating a search index 17, according to an exemplary embodiment. The search index 17 includes a data item index 118, a vector position index 116 and a text hash table 114.
The data item index 118 includes all data items 43 in the storage and information retrieval platform 12. Each data item 43 includes a set of attributes 45, which are named fields that enable access to corresponding attribute values 47. In one embodiment, the data item 43 includes a data item identification attribute 51, a title attribute 53, a category attribute 55, a price attribute 57, a description attribute 59 and a manufacturer attribute 61. Other embodiments may include different and/or additional attributes 45.
The text hash table 114 is indexed by a numeric value generated by an algorithm that accepts a word of text as input (e.g., “Palm”). Each entry in the text hash table 114 points to a vector position index 116. The vector position index 116 links a word in the text hash table 114 (e.g., “Palm”) to a corresponding set of vector positions 117. Each vector position 117 includes a data item identification 51 and a position 124. The data item identification 51 identifies a data item 43 in the data item index 118. The position 124 identifies the word position in the attribute value 47 for the title attribute 53 (e.g., “Palm). Other embodiments may enable searching of other text attributes 45 (e.g., description attribute 59) or combinations thereof.
FIG. 5 is a block diagram illustrating search tables 131, according to an exemplary embodiment, that are utilized by the search engine 39. The search tables 131 include an identified data items table 130, an attribute lists table 132, a standard attributes list table 137, a sub-range hash table 134, and an exact-match hash table 136. The tables illustrated are generated responsive to a search request from a user. One or more hash tables may be generated.
The identified data items table 130 includes all data items 43 responsive to a user's search request (e.g., a keyword request, an identification request or a browse request) after filtering has been performed.
The attribute lists table 132 includes multiple lists of attributes 133. Each list of attributes 133 includes attributes 45. In one embodiment, the attribute list table 132 is indexed by a category to access a list of attributes 133 that identifies data attributes for data items that are classified within the corresponding category. It will be appreciated that other embodiments may utilize structures other than categories to classify data items.
The standard attribute list table 137 includes an attribute list table 133 that identifies attributes 45 that are common to all data items.
The sub-range hash tables 134 and the exact-match hash tables 136 are temporary data structures that are generated and utilized by the search engine 39 to record a distribution of data items in a search result based on an attribute value in a data item (e.g., price, manufacturer, color, etc.). The search engine 39 generates a hash table for each attribute specified in the attribute list table 132 or for each item specified in a standard attribute list table 133.
The sub-range hash table 134 is utilized to count the frequency of data items based on a numeric attribute value 47 (e.g., a number). The sub-range hash table 134 is indexed by a hash value that is generated by concatenating attribute 45 and bucket ID text strings. For example, the attribute 45 may be a text string such as “title”, “category”, “price”, etc and the bucket may be a text string that corresponds to a numeric range of values associated with the attribute 45.
The exact-match hash table 136 is utilized to count the frequency of data items based on an attribute value 47 that contains text. The exact-match hash table 136 is indexed by a hash value that is generated from an attribute 45 text string and corresponding attribute values 47 text string. For example, an exact-match hash table 136 may be generated for the attribute manufacturer 61 by concatenating the string “manufacturer” with every possible attribute value (e.g., “Sony”, “Palm”, “Apple”, etc.).
FIG. 6 is a flowchart illustrating a method 140, according to an exemplary embodiment, to facilitate a search of an information resource. At box 142, the identifying module 138 identifies data items 43 responsive to a search request from a user.
FIG. 10 illustrates a user interface 144, according to an exemplary embodiment, to generate a keyword search request or an identification search request. The user interface 144 includes a number of screen elements that allow the user to identify and filter data items 43. A text entry box 146 enables a user to specify a keyword or item number that will be utilized by the identification module 142 to identify all data items 43 that include the keywords or match the item number. A number of filters 148 are illustrated and may be utilized by the user to cause the identifying module 142 to remove data items 43 from a generated search result. For example, a user may filter data items 43 that contain specified words and/or data items that are classified in a category other than a specified category and/or data items that contain a price outside a specified range and/or data items that ship from a location other than a location specified.
In the present example, the user enters the words “Palm Pilot” to initiate a keyword search. The identifying module 138 responds by identifying the appropriate data items 43 and the information storage and retrieval platform 12 displays a user interface 150, as illustrated in FIG. 11, according to an exemplary embodiment of the present invention.
The user interface 150 displays all the data items 43 that contain the words “Palm” and/or “Pilot”. The user interface 150 includes a number of categories 55 that may be selected by the user to further identify data items within the category 55. In the present example, the user selects the category 55 “Handheld Units”.
Returning to FIG. 6, at box 142, the identifying module 138 filters the data items 43 that contain the words “Palm” and/or “Pilot” by removing all data items that are not in the category “Handheld Units”.
At box 152, the analyzing module 140 analyzes data items 43 by building hash tables, extracting values from data items 43 and identifying distributions of data items for one or more attributes common to the data items, as illustrated on FIG. 7, according to an exemplary embodiment of the present invention.
In FIG. 7, at box 154 the analyzing module 140 builds hash tables corresponding to the search results as illustrated on FIG. 8, according to an exemplary embodiment.
In FIG. 8, at decision box 156, the analyzing module 140 determines if the search results are responsive to a browse request. If the search results are responsive to a browse request, then a branch is made to box 158. Otherwise a branch is made to box 160.
At box 158, the analyzing module 140 indexes into the attribute list table 132 based on the category “Handheld Units”, as specified by the user, and extracts the corresponding list of attributes 133. Otherwise, at box 160, the analyzing module 140 gets a list of attributes 133 from the standard attribute list table 137.
At box 162, the analyzing module 140 gets the next attribute in the list of attributes 133.
At decision box 164, the analyzing module 140 determines if the current attribute in the list of attributes 133 is a numeric attribute or text attribute. If the current attribute in the list of attributes 133 is a numeric attribute, then a branch is made to box 166. Otherwise a branch is made to box 168.
At box 166, the analyzing module 140 generates a sub-range hash table 134 for the numeric attribute 45. Otherwise, at box 168, the analyzing module 140 generates an exact-match hash table 48 for the text attribute 45.
At decision box 170, the analyzing module 140 determines if there are more attributes 45 in list of attributes 133. If there are more attributes 45 in the attribute list 133 then the analyzing module 140 branches to box 162. Otherwise processing ends.
Returning to FIG. 7, at box 171, the analyzing module 140 gets the next data item 43.
At box 172, the analyzing module 140 extracts an attribute value 47 from the data item 43.
At box 174, the analyzing module 140 generates a hash value by concatenating the attribute name 45 and the attribute value 47 or the associated bucket ID. Next, the analyzing module 140 utilizes the hash value to accesses the appropriate entry in the exact-match hash table 136 or the sub-range hash table 134 and increments the counter 135.
At decision box 176, the analyzing module 140 determines if there are more attributes in the data item 43. If there are more attributes in the data item 43 then a branch is made to box 172. Otherwise processing continues at decision box 178.
At decision box 178, the analyzing module 140 determines if there are more data items 43 in the identified data items table 130. If there are more data items, then the analyzing module 140 branches to box 171. Otherwise, processing ends.
Returning to FIG. 6, at box 180, the determining module 142 determines if the distributions of data items as described by the hash tables facilitate additional searching by the user. FIG. 9 illustrates the box 180, according to an exemplary embodiment.
At box 182, the determining module 142 zeroes a peak or modal counter and gets a hash table that is associated with an attribute.
At box 186, the determining module 142 extracts the frequency of data items from a counter 135 in the hash table.
At decision box 188, the determining module 142 determines if the counter 135 exceeds a predetermined threshold. If the counter 135 exceeds a predetermined threshold, then a branch is made to box 190. Otherwise, processing continues at decision box 196.
At box 190, the determining module 142 increments the peak counter.
At decision box 192, the determining module 142 determines if the peak counter is greater than 1. If the peak counter is greater than 1, then the determining module 142 branches to box 194. Otherwise, processing continues at decision box 196.
At box 194, the determining module 142 registers the distribution of data items 43 for communication to the user.
At decision box 196, the determining module 142 determines if there are more counters 135 in the hash table. If there are more counters 135 in the hash table, then the determining module 142 branches to box 186. Otherwise, processing continues at decision box 197.
At decision box 197, the determining module 142 determines if the peaks in the hash table form a flat distribution. If the peaks form a flat distribution then a branch is made to box 199. Otherwise a branch is made to decision box 198.
At box 199, the determining module 142 unregisters the distribution for communication to the user and processing continues at decision box 198.
At decision box 198, the determining module 142 determines if there are more hash tables. If there are more hash tables, then processing continues at box 182. Otherwise, processing continues at box 200. It will be appreciated that some embodiments may include multiple hash tables for the same attribute. For example, a first hash table associated with a first range of attribute values may include the sub-range of attribute values of $1.00-$6.99, $7.00-$12.99 and $13.00-$18.99 and a second hash table associated with a second range of attribute values may include the sub-range attribute values of $7.00-$8.99, $9.00-$10.99 and $11.00-$12.99. If, for example, a single mode or peak distribution was identified with the first range of attribute values then the second range of attribute values may be utilized instead of the first range of attribute values to identify a distribution that facilitates searching the information resource.
At box 200, the communication module 144 communicates a user interface to the user that includes distributions of data items that were identified to facilitate searching the information resource. FIG. 12 illustrates a user interface 202, according to an exemplary embodiment. User interface 202 includes an pie chart 204 for a price attribute 57, a manufacturing pie chart 206 for a manufacturing attribute 61 and a histogram 208 a feature attribute. The pie charts and histogram illustrate distributions for all data items in the “Handheld Units” category that contain the words “Palm” and/or “Pilot” that were identified to facilitate a search the information resource. For example, the user may glean distributions for price range, manufacturer and Palm Pilot features. Note that the pie chart 204 communicates an absolute count of Palm Pilots corresponding to each segment of the pie chat 204 and that the pie chart 206 communicates a percentage of Palm Pilots corresponding to each segment of the pie chart 206. It will be appreciated that a user could select, via a mouse or keyboard keystrokes, components of the histogram 208 or pie charts 204 or 206 to further filter the search results.
Note that attributes 45 with distributions that do not facilitate the search of the information resource are not displayed. For example, an attribute may not be displayed if the associated distribution exhibits a single peak, exhibits one or no peaks, exhibits a flat distribution, etc.
In another embodiment, the communication module 144 may communicate a user interface that includes only selected attribute value selectors for attributes with identified distributions of data items 43 that facilitate searching the information resource. FIG. 13 illustrates a user interface 220, according to an exemplary embodiment, including attribute value selectors. The user interface 220 includes a price range attribute value selector 222, a manufacturer attribute value selector 224, and a feature attribute value selector 226. The user interface 220 does not include attribute value selectors for attributes with distributions that do not facilitate the search of the information resource; but rather, only meaningful attribute value selectors are presented. The user interface 220 facilitates the search of the information resource by enabling the user to further filter the search results by selecting on or more attribute values with the attribute value selectors 222, 224 or 226.
Network Based Trading Platform Embodiment
The above-described invention may be embodied in any system that requires the storage and retrieval of data items. For example, the invention may be embodied in a network-based trading platform 230 as described below.
FIG. 14 is a network diagram depicting a system 232, according to one exemplary embodiment of the present invention, having a client-server architecture. A commerce platform, in the exemplary form of a network-based trading platform 230, provides server-side functionality, via a network 234 (e.g., the Internet) to one or more clients. FIG. 14 illustrates, for example, a web client 236 (e.g., a browser, such as the INTERNET EXPLORER browser developed by Microsoft Corporation of Redmond, Wash. State), and a programmatic client 238 executing on respective client machines 240 and 242.
Turning specifically to the network-based trading platform 230, an Application Program Interface (API) server 244 and a web server 246 are coupled to, and provide programmatic and web interfaces respectively to, one or more application servers 248. The application servers 248 host one or more marketplace applications 250 and payment applications 252. The application servers 248 are, in turn, shown to be coupled to one or more databases servers 254 that facilitate access to one or more databases 256.
The marketplace applications 250 provide a number of marketplace functions and services to users that access the network-based trading platform 230. The payment applications 252 likewise provide a number of payment services and functions to users. The payment applications 256 may allow users to quantify for, and accumulate, value (e.g., in a commercial currency, such as the U.S. dollar, or a proprietary currency, such as “points”) in accounts, and then later to redeem the accumulated value for products (e.g., goods or services) that are made available via the marketplace applications 250. While the marketplace applications 250 and payment applications 252 are shown in FIG. 14 to both form part of the network-based trading platform 230, it will be appreciated that, in other embodiments, the payment applications 252 may form part of a payment service that is separate and distinct from the network-based trading platform 230.
Further, while the system 232 shown in FIG. 14 employs a client-server architecture, the present invention is of course not limited to such an architecture, and could equally well find application in a distributed, or peer-to-peer, architecture system. The various marketplace and payment applications 250 and 252 could also be implemented as standalone software programs, which do not necessarily have networking capabilities.
The web client 236, it will be appreciated, accesses the various marketplace and payment applications 250 and 252 via the web interface supported by the web server 246. Similarly, the programmatic client 238 accesses the various services and functions provided by the marketplace and payment applications 250 and 252 via the programmatic interface provided by the API server 244. The programmatic client 238 may, for example, be a seller application (e.g., the TURBOLISTER application developed by eBay Inc., of San Jose, Calif.) to enable sellers to author and manage listings on the network-based trading platform 230 in an off-line manner, and to perform batch-mode communications between the programmatic client 238 and the network-based trading platform 230.
FIG. 14 also illustrates a third party application 258, executing on a third party server machine 260, as having programmatic access to the network-based trading platform 230 via the programmatic interface provided by the API server 244. For example, the third party application 258 may, utilizing information retrieved from the network-based trading platform 230, support one or more features or functions on a website hosted by the third party. The third party website may, for example, provide one or more promotional, marketplace or payment functions that are supported by the relevant applications of the network-based trading platform 230.
Marketplace and Payment Applications
FIG. 15 is a block diagram illustrating multiple marketplace applications 250 and payment applications 252 that, in one exemplary embodiment, are provided as part of the network-based trading platform 230. The network-based trading platform 230 may provide a number of listing and price-setting mechanisms whereby a seller may list goods or services for sale, a buyer can express interest in or indicate a desire to purchase such goods or services, and a price can be set for a transaction pertaining to the goods or services. To this end, the marketplace applications 250 are shown to include one or more auction applications 44 which support auction-format listing and price setting mechanisms (e.g., English, Dutch, Vickrey, Chinese, Double, Reverse auctions etc.). The various auction applications 44 may also provide a number of features in support of such auction-format listings, such as a reserve price feature whereby a seller may specify a reserve price in connection with a listing and a proxy-bidding feature whereby a bidder may invoke automated proxy bidding.
Reputation applications 50 allow parties that transact utilizing the network-based trading platform 230 to establish, build and maintain reputations, which may be made available and published to potential trading partners. Consider that where, for example, the network-based trading platform 230 supports person-to-person trading, users may have no history or other reference information whereby the trustworthiness and credibility of potential trading partners may be assessed. The reputation applications 50 allow a user, for example through feedback provided by other transaction partners, to establish a reputation within the network-based trading platform 230 over time. Other potential trading partners may then reference such a reputation for the purposes of assessing credibility and trustworthiness.
Personalization applications 52 allow users of the network-based trading platform 230 to personalize various aspects of their interactions with the network-based trading platform 230. For example a user may, utilizing an appropriate personalization application 52, create a personalized reference page at which information regarding transactions to which the user is (or has been) a party may be viewed. Further, a personalization application 52 may enable a user to personalize listings and other aspects of their interactions with the network-based trading platform 230 and other parties.
In one embodiment, the network-based trading platform 230 may support a number of marketplaces that are customized, for example, for specific geographic regions. A version of the network-based trading platform 230 may be customized for the United Kingdom, whereas another version of the network-based trading platform 230 may be customized for the United States. Each of these versions may operate as an independent marketplace, or may be customized (or internationalized) presentations of a common underlying marketplace. The latter version may characterize a user's access to the network-based trading platform 230 as originating from a particular country by identifying the country specific presentation that is selected by the user.
Navigation of the network-based trading platform 230 may be facilitated by one or more navigation applications 56. For example, a search application allows a user to execute key word searches of data items 43 or listings published via the network-based trading platform 230. A browse application allows users to browse various category, catalogue, or inventory data structures according to which data items 43 or listings may be classified within the network-based trading platform 230. Indeed, the navigation applications 56 may include an identifying module 138, an analyzing module 140, a determining module 142 and a communication module 144, as described above, and any other software and/or hardware components necessary to embody the present invention. Other navigation applications may also be provided including a rules engine that applies a characteristic rule to a listing to facilitate filtering the listing, a scrubber for normalizing listings, and a search database engine for maintaining a search index and a search engine that facilitates the search and browse applications.
In order to make listings, available via the network-based trading platform 230, as visually informing and attractive as possible, the marketplace applications 250 may include one or more imaging applications 58 utilizing which users may upload images for inclusion within listings. An imaging application 58 also operates to incorporate images within viewed listings. The imaging applications 58 may also support one or more promotional features, such as image galleries that are presented to potential buyers. For example, sellers may pay an additional fee to have an image included within a gallery of images for promoted items.
Listing creation applications 60 allow sellers to conveniently author listings pertaining to goods or services that they wish to transact via the network-based trading platform 230, and listing management applications 62 allow sellers to manage such listings. Specifically, where a particular seller has authored and/or published a large number of listings, the management of such listings may present a challenge. The listing management applications 62 provide a number of features (e.g., auto-relisting, inventory level monitors, etc.) to assist the seller in managing such listings. One or more post-listing management applications 64 also assist sellers with a number of activities that typically occur post-listing. For example, upon completion of an auction facilitated by one or more auction applications 44, a buyer may wish to leave feedback regarding a particular seller. To this end, a post-listing management application 64 may provide an interface to one or more reputation applications 50, so as to allow the buyer to conveniently to provide feedback regarding a seller to the reputation applications 50. Feeback may take the form of a review that is registered as a positive comment, a neutral comment or a negative comment. Further, points may be associated with each form of comment (e.g., +1 point for each positive comment, 0 for each neutral comment, and −1 for each negative comment) and summed to generate a rating for the seller.
Messaging applications 70 are responsible for the generation and delivery of messages to users of the network-based trading platform 230, such messages for example advising users regarding the status of listings at the network-based trading platform 230 (e.g., providing “outbid” notices to bidders during an auction process or to provide promotional and merchandising information to users).
Merchandising applications 72 support various merchandising functions that are made available to sellers to enable sellers to increase sales via the network-based trading platform 230. The merchandising applications 80 also operate the various merchandising features that may be invoked by sellers, and may monitor and track the success of merchandising strategies employed by sellers.
The network-based trading platform 230 itself, or one or more parties that transact via the network-based trading platform 230, may operate loyalty programs that are supported by one or more loyalty/promotions applications 74. For example, a buyer may earn loyalty or promotions points for each transaction established and/or concluded with a particular seller, and be offered a reward for which accumulated loyalty points can be redeemed.
Marketplace Data Structures
FIG. 16 is a high-level entity-relationship diagram, illustrating various tables 90 that may be maintained within the databases 256, and that are utilized by and support the marketplace applications 250 and payment applications 252. While the exemplary embodiment of the present invention is described as being at least partially implemented utilizing a relational database, other embodiments may utilize other database architectures (e.g., an object-oriented database schema).
A user table 92 contains a record for each registered user of the network-based trading platform 230, and may include identifier, address and financial instrument information pertaining to each such registered user. A user may operate as a seller, a buyer, or both, within the network-based trading platform 230. In one exemplary embodiment of the present invention, a buyer may be a user that has accumulated value (e.g., commercial or proprietary currency), and is then able to exchange the accumulated value for items that are offered for sale by the network-based trading platform 230.
The tables 90 also include an items or listings table 94 in which are maintained item records for goods and services that are available to be, or have been, transacted via the network-based trading platform 230. Each item record within the items table 94 may furthermore be linked to one or more user records within the user table 92, so as to associate a seller and one or more actual or potential buyers with each item record.
A transaction table 96 contains a record for each transaction (e.g., a purchase transaction) pertaining to items for which records exist within the items table 94.
An order table 98 is populated with order records, each order record being associated with an order. Each order, in turn, may be with respect to one or more transactions for which records exist within the transactions table 96.
Bid records within a bids table 100 each relate to a bid received at the network-based trading platform 230 in connection with an auction-format listing supported by an auction application 44. A feedback table 102 is utilized by one or more reputation applications 50, in one exemplary embodiment, to construct and maintain reputation information concerning users. A history table 104 maintains a history of transactions to which a user has been a party. One or more attributes tables including an item attributes table 105 that records attribute information pertaining to items for which records exist within the items table 94 and a user attributes table 106 that records attribute information pertaining to users for which records exist within the user table 92.
FIG. 17 shows a diagrammatic representation of machine in the exemplary form of a computer system 300 within which a set of instructions, for causing the machine to perform any one or more of the methodologies discussed herein, may be executed. In alternative embodiments, the machine operates as a standalone device or may be connected (e.g., networked) to other machines. In a networked deployment, the machine may operate in the capacity of a server or a client machine in server-client network environment, or as a peer machine in a peer-to-peer (or distributed) network environment. The machine may be a server computer, a client computer, a personal computer (PC), a tablet PC, a set-top box (STB), a Personal Digital Assistant (PDA), a cellular telephone, a web appliance, a network router, switch or bridge, or any machine capable of executing a set of instructions (sequential or otherwise) that specify actions to be taken by that machine. Further, while only a single machine is illustrated, the term “machine” shall also be taken to include any collection of machines that individually or jointly execute a set (or multiple sets) of instructions to perform any one or more of the methodologies discussed herein.
While the machine-readable medium 322 is shown in an exemplary embodiment to be a single medium, the term “machine-readable medium” should be taken to include a single medium or multiple media (e.g., a centralized or distributed database, and/or associated caches and servers) that store the one or more sets of instructions. The term “machine-readable medium” shall also be taken to include any medium that is capable of storing, encoding or carrying a set of instructions for execution by the machine and that cause the machine to perform any one or more of the methodologies of the present invention. The term “machine-readable medium” shall accordingly be taken to include, but not be limited to, solid-state memories, optical media, and magnetic media.
Thus, a method and system to facilitate a search of an information resource have been described. Although the present invention has been described with reference to specific exemplary embodiments, it will be evident that various modifications and changes may be made to these embodiments without departing from the broader spirit and scope of the invention. Accordingly, the specification and drawings are to be regarded in an illustrative rather than a restrictive sense.
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS5946681 *Nov 28, 1997Aug 31, 1999International Business Machines CorporationMethod of determining the unique ID of an object through analysis of attributes related to the objectUS6154738 *May 21, 1999Nov 28, 2000Call; Charles GainorMethods and apparatus for disseminating product information via the internet using universal product codesUS6216123 *Jun 24, 1998Apr 10, 2001Novell, Inc.Method and system for rapid retrieval in a full text indexing systemUS6286005 *Mar 11, 1998Sep 4, 2001Cannon Holdings, L.L.C.Method and apparatus for analyzing data and advertising optimizationUS6424973 *Jul 23, 1999Jul 23, 2002Jarg CorporationSearch system and method based on multiple ontologiesUS6556987 *Jul 13, 2000Apr 29, 2003Applied Psychology Research, Ltd.Automatic text classification systemUS6564197 *May 3, 1999May 13, 2003E.Piphany, Inc.Method and apparatus for scalable probabilistic clustering using decision treesUS6604107 *Apr 24, 2000Aug 5, 2003Ebay Inc.Generic attribute database system for storing items of different categories having shared attributesUS6735586 *Feb 8, 2001May 11, 2004Sybase, Inc.System and method for dynamic content retrievalUS6799174 *Sep 17, 2001Sep 28, 2004Science Applications International CorporationRetrieving, organizing, and utilizing networked data using databasesUS6834350 *Jul 6, 1999Dec 21, 2004Watchguard Technologies, Inc.Secure and differentiated delivery of network security informationUS6904435 *Jun 9, 2003Jun 7, 2005Genworth Financial, Inc.Method and system for secure electronic distribution, archiving and retrievalUS6963867 *Mar 31, 2003Nov 8, 2005A9.Com, Inc.Search query processing to provide category-ranked presentation of search resultsUS7130820 *Jan 18, 2005Oct 31, 2006Amazon.Com, Inc.Methods and systems of assisting users in purchasing itemsUS7146416 *Sep 1, 2000Dec 5, 2006Yahoo! Inc.Web site activity monitoring system with tracking by categories and termsUS7165119 *Oct 14, 2003Jan 16, 2007America Online, Inc.Search enhancement system and method having rankings, explicitly specified by the user, based upon applicability and validity of search parameters in regard to a subject matterUS7203675 *Feb 19, 2002Apr 10, 2007Ncr Corp.Methods, systems and data structures to construct, submit, and process multi-attributal searchesUS7233908 *Nov 5, 2001Jun 19, 2007Quality Data Management, Inc.Method and system for presentation of survey and report dataUS7246110 *May 25, 2000Jul 17, 2007Cnet Networks, Inc.Product feature and relation comparison systemUS7257571 *Jan 26, 2004Aug 14, 2007Microsoft CorporationAutomatic query clusteringUS7302467 *Aug 7, 2001Nov 27, 2007Sony CorporationInformation processing device and information processing method, service providing system, and computer-executable program for the sameUS7359905 *Jun 24, 2003Apr 15, 2008Microsoft CorporationResource classification and prioritization systemUS7386535 *Oct 1, 2003Jun 10, 2008Q.Know Technologies, Inc.Computer assisted and/or implemented method for group collarboration on projects incorporating electronic informationUS7539636 *Oct 1, 2003May 26, 2009Itg Software Solutions, Inc.System and method for estimating transaction costs related to trading a securityUS7567970 *Nov 22, 2006Jul 28, 2009Nhn CorporationContents search system for providing reliable contents through network and method thereofUS20010049671 *Jun 5, 2001Dec 6, 2001Joerg Werner B.e-Stract: a process for knowledge-based retrieval of electronic informationUS20010054009 *Feb 14, 2001Dec 20, 2001Miller Michael RobertSystem, method, and article of manufacture for a network-based gift registry systemUS20020004735 *Jan 18, 2001Jan 10, 2002William GrossSystem and method for ranking itemsUS20020038304 *Jun 29, 2001Mar 28, 2002Boris GelfandData cells and data cell generationsUS20020059202 *May 14, 2001May 16, 2002Mirsad HadzikadicIncremental clustering classifier and predictorUS20020087558 *Jan 18, 2002Jul 4, 2002Caterpillar Inc.Database system facilitating parametric searchingUS20020116382 *Jan 30, 2002Aug 22, 2002Kazuhiro KoyamaData distribution systemUS20020188676 *May 17, 2002Dec 12, 2002Fujiko IaiData server, data distribution program, computer-readable record medium bearing data distribution program, and client apparatusUS20030014396 *Jul 16, 2001Jan 16, 2003Navin KabraUnified database and text retrieval systemUS20030014483 *Apr 12, 2002Jan 16, 2003Stevenson Daniel C.Dynamic networked content distributionUS20030020726 *Jun 28, 2002Jan 30, 2003Bitflash Graphics, Inc.Method and system for displaying graphics informationUS20030050927 *Apr 22, 2002Mar 13, 2003Araha, Inc.System and method for location, understanding and assimilation of digital documents through abstract indiciaUS20030061243 *Aug 26, 2002Mar 27, 2003Kim Jeong JungInformation auto classification method and information search and analysis methodUS20030131315 *Dec 17, 2002Jul 10, 2003Escher Richard E.A.Method for chart markup and annotation in technical analysisUS20030172060 *Jan 13, 2003Sep 11, 2003Makoto UchikadoInformation retrieval-distribution systemUS20030187835 *Sep 14, 2001Oct 2, 2003Augustin HuretSearch engineUS20030212669 *May 21, 2002Nov 13, 2003Aatish DedhiaSystem and method for context based searching of electronic catalog database, aided with graphical feedback to the userUS20040015416 *Jul 22, 2002Jan 22, 2004Benjamin David FosterSeller configurable merchandising in an electronic marketplaceUS20040019536 *Dec 18, 2002Jan 29, 2004Amir AshkenaziSystems and methods for facilitating internet shoppingUS20040059740 *Aug 15, 2003Mar 25, 2004Noriko HanakawaDocument management methodUS20040083453 *Jun 16, 2003Apr 29, 2004International Business Machines CorporationArchitecture for dynamically monitoring computer application dataUS20040088159 *Oct 31, 2002May 6, 2004Allan J. VolponiMethod for performing an empirical test for the presence of bi-modal dataUS20040093354 *Sep 23, 2003May 13, 2004Changsheng XuMethod and system of representing musical information in a digital representation for use in content-based multimedia information retrievalUS20040133500 *Oct 22, 2003Jul 8, 2004Globaltec Solutions, LlpApparatus and method for displaying trading trendsUS20040153527 *Jan 31, 2003Aug 5, 2004Sierra Wireless, Inc., A Canadian CorporationToken-based Web browsing with visual feedback of disclosureUS20040155898 *Jul 24, 2003Aug 12, 2004Fuji Xerox Co., Ltd.Image processing systemUS20040210491 *Jul 24, 2003Oct 21, 2004Pasha SadriMethod for ranking user preferencesUS20040254851 *Mar 22, 2004Dec 16, 2004Kabushiki Kaisha ToshibaElectronic merchandise distribution apparatus, electronic merchandise receiving terminal, and electronic merchandise distribution methodUS20040267731 *Apr 23, 2004Dec 30, 2004Gino Monier Louis MarcelMethod and system to facilitate building and using a search databaseUS20050039111 *Nov 12, 2001Feb 17, 2005Keiko AbeProgram additional data processing device, server apparatus, program information display method, and recorded mediumUS20050076772 *Oct 10, 2003Apr 14, 2005Gartland-Jones Andrew PriceMusic composing systemUS20050080769 *Oct 14, 2003Apr 14, 2005Microsoft CorporationSystem and process for presenting search results in a histogram/cluster formatUS20050091183 *Oct 23, 2003Apr 28, 2005Cunningham Conor J.Type path indexingUS20050120009 *Nov 18, 2004Jun 2, 2005Aker J. B.System, method and computer program application for transforming unstructured textUS20050192955 *Mar 1, 2004Sep 1, 2005International Business Machines CorporationOrganizing related search resultsUS20070288441 *May 18, 2007Dec 13, 2007Wolff Gregory JSynchronizing distributed work through document logsUS20080015870 *May 30, 2003Jan 17, 2008Lawrence Benjamin ElowitzApparatus and method for facilitating a search for gemsUS20080016059 *Jul 27, 2007Jan 17, 2008Kontera Technologies, Inc.Dynamic document context mark-up technique implemented over a computer networkUS20080033787 *Jan 24, 2007Feb 7, 2008Keil Sev KPreference information-based metrics* Cited by examinerNon-Patent CitationsReference1 *Wu et al., Efficient Query Monitoring Using Adaptive Multiple Key Hashing, Nov. 2002, ACM, pp. 477-484.* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS8622290 *Jun 29, 2012Jan 7, 2014NetSuite Inc.Multiple rate currency consolidatorUS8743889 *Jul 6, 2011Jun 3, 2014Nicira, Inc.Method and apparatus for using a network information base to control a plurality of shared network infrastructure switching elementsUS8954411Dec 21, 2011Feb 10, 2015Ebay Inc.Method and system to facilitate a search of an information resourceUS20100185651 *Jan 16, 2009Jul 22, 2010Google Inc.Retrieving and displaying information from an unstructured electronic document collectionUS20130054440 *Feb 28, 2013NetSuite Inc.Multiple rate currency consolidator* Cited by examinerClassifications U.S. Classification707/705, 707/E17.002, 707/999.003, 707/E17.044International ClassificationG06F17/30, G06F7/00Cooperative ClassificationG06F17/30943, G06F17/30864, Y10S707/99933European ClassificationG06F17/30W1Legal EventsDateCodeEventDescriptionFeb 10, 2005ASAssignmentOwner name: EBAY INC., CALIFORNIAFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BILLINGSLEY, ERIC NOEL;MONIER, LOUIS MARCEL GINO;ARORA, ADITYA;REEL/FRAME:015701/0666Effective date: 20050207Mar 12, 2013CCCertificate of correctionJun 17, 2015FPAYFee paymentYear of fee payment: 4RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services