초록 ▼

Disclosed is a technique for providing, accessing, and using bookmark data to supplement information in a search engine database. The bookmark data indicates saved user selected network addresses, e.g., URLs, that are capable of being selected to access observable data, e.g., a page of text, images,

Disclosed is a technique for providing, accessing, and using bookmark data to supplement information in a search engine database. The bookmark data indicates saved user selected network addresses, e.g., URLs, that are capable of being selected to access observable data, e.g., a page of text, images, sound file, movie file, etc., at the selected network address. A user computer receives user modifications to bookmark data and transmits the modifications to the bookmark data to a server over a network. A server gathers bookmark data indicating saved user selected network addresses that the user is capable of selecting to access observable data at the selected network address. A search engine server receives bookmark data gathered from multiple Internet users and determines an importance rating for at least one network address from the received bookmark data. The determined importance rating is included in the search engine index. Further, when executing a search query against the index to determine at least one search result, the search engine server presents the search results ordered according to their importance rating.

대표청구항 ▼

Disclosed is a technique for providing, accessing, and using bookmark data to supplement information in a search engine database. The bookmark data indicates saved user selected network addresses, e.g., URLs, that are capable of being selected to access observable data, e.g., a page of text, images,

Disclosed is a technique for providing, accessing, and using bookmark data to supplement information in a search engine database. The bookmark data indicates saved user selected network addresses, e.g., URLs, that are capable of being selected to access observable data, e.g., a page of text, images, sound file, movie file, etc., at the selected network address. A user computer receives user modifications to bookmark data and transmits the modifications to the bookmark data to a server over a network. A server gathers bookmark data indicating saved user selected network addresses that the user is capable of selecting to access observable data at the selected network address. A search engine server receives bookmark data gathered from multiple Internet users and determines an importance rating for at least one network address from the received bookmark data. The determined importance rating is included in the search engine index. Further, when executing a search query against the index to determine at least one search result, the search engine server presents the search results ordered according to their importance rating. n submitted, and whose identity is not specified for execution during any recurring interval by the schedule, and wherein the step of executing a thread of the next computer program specified by the circular list of activities in some cases executes a thread of the non-real-time program, such that threads of the non-real-time computer program are executed despite the fact that no reservation was submitted on behalf of the non-real-time program. 18. The method of claim 16 wherein each of the computer programs is a non-real-time program on whose behalf no reservation is submitted, and wherein the withholding step withholds from assignment to any computer program all of the recurring intervals of the series, and wherein the step of executing a thread of the next computer program specified by the circular list of activities in each case executes a thread of a non-real-time program, such that threads of the non-real-time programs are executed despite the fact that no reservations have been submitted on their behalf. 19. The method of claim 16, further comprising the step of, for each computer program, maintaining a circular list of the threads of the computer program reflecting an order for distributing undedicated iterations of withheld recurring intervals and specifying a next thread to receive undedicated iterations of withheld intervals, and wherein the executing step includes the step of, for iterations of withheld recurring intervals not dedicated to any time constraint, executing the next thread of the next computer program specified by the circular list of activities and the circular list of threads of the next computer program. 20. A method in a computer system for scheduling the execution of a plurality of Cads based in part on time constraints each submitted on behalf of one of the threads, each time constraint being either active or inactive, each thread belonging to one of one or more activities, the method including the steps of: based in part on the active time constraints, selecting an activity for execution; if any time constraint submitted on behalf of one of the threads of the selected activity is inactive, selecting for execution the thread upon whose behalf the time constraint was submitted; and if no time constraint submitted on behalf of one of the threads of the selected activity is inactive, selecting a thread for execution from among all of the threads belonging to the selected activity. 21. A method in a computer system for scheduling the execution of a plurality of activities each having one or more threads, each thread capable of either being executable or being blocked, the method comprising the steps of: (a) generating a schedule specifying, for a plurality of future times, which activity will be executing unless all of the threads of that activity are blocked; (b) executing the threads of each activity in accordance with the schedule generated in step (a); (c) during the performance of step (b), identifying an activity whose threads are all blocked; (d) in response to step (c), when any of the threads of the identifier activity is unblocked, determining whether the threads of the identified activity were all blocked for at least a threshold amount of time; and (e) if the threads of the identified activity were not all blocked for at least the threshold amount of time, executing one or more threads of the identified activity during times for which the schedule generated in step (a) does not specify that the identified activity will be executing, in order to compensate for the failure of the identified activity to execute while all of its threads were blocked. 22. The method of claim 21, fur