Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader.

Patents

  1. Advanced Patent Search
Publication numberUS20050177564 A1
Publication typeApplication
Application numberUS 11/104,624
Publication dateAug 11, 2005
Filing dateApr 13, 2005
Priority dateMar 13, 2003
Publication number104624, 11104624, US 2005/0177564 A1, US 2005/177564 A1, US 20050177564 A1, US 20050177564A1, US 2005177564 A1, US 2005177564A1, US-A1-20050177564, US-A1-2005177564, US2005/0177564A1, US2005/177564A1, US20050177564 A1, US20050177564A1, US2005177564 A1, US2005177564A1
InventorsTetsushi Kobayashi, Toshihiko Oda, Yoshiaki Imajima
Original AssigneeFujitsu Limited
Export CitationBiBTeX, EndNote, RefMan
External Links: USPTO, USPTO Assignment, Espacenet
Server, method, computer product, and terminal device for searching item data
US 20050177564 A1
Abstract
A WEB server includes a memory unit, an index data searching unit that searches plurality of item data in the memory unit, a sorting unit sorts the item data searched by the index data searching unit by date. When a search request for requesting a search with designation of a keyword and a search period is made on one of terminal devices, the index data searching unit searches a plurality of the index data in the memory unit using the keyword. If the number of the hits exceeds a predetermined number, the index data searching unit re-searches the index data after shortening the search period. The WEB server outputs the results of the search or the re-search to the terminal device.
Images(6)
Previous page
Next page
Claims(19)
1. A server for searching item data, comprising:
a memory unit that stores item data corresponding to items of periodicals;
a searching unit that searches a plurality of item data in the memory unit when a search request requesting a search for item data in with designation of a keyword corresponding to the item data is received from a terminal device, and if number of hit item data exceeds a predetermined number, re-searches the hit item data after shortening a search period;
a sorting unit that sorts the hit item data or re-hit item data by date; and
an outputting unit that outputs data sorted by the sorting unit to the terminal device.
2. The server according to claim 1, wherein when the search request received contains no search period, the searching includes searching for item data having the designated keyword out of the item data with dates within a predetermined first period, and if number of hit item data exceeds a predetermined number, re-searches the hit item data within a predetermined second period that is within and shorter than the predetermined first period.
3. The server according to claim 1, wherein when the search request contains a search period, the searching includes searching the item data having the designated keyword out of the item data having dates within the search period.
4. The server according to claim 1, wherein when the number of the re-hit item data exceeds a predetermined number, the searching unit repeatedly re-searches for item data while shortening the search period until number of the re-hit item data is less than the predetermined number.
5. The server according to claim 1, wherein the search period includes a search start date and a search end date, and
when the number of the hit item data exceeds the predetermined number, the searching unit shortens the search period by shifting the search start date based on number of days of the search period, number of data that can be displayed on the terminal device, and the number of the item data.
6. The server according to claim 1, wherein the search period includes a search start date and a search end date, and
when the number of the hit item data exceeds the predetermined number, the searching unit shortens the search period by shifting the search end date based on number of days of the search period, number of data that can be displayed on the terminal device, and the number of the item data.
7. A method for searching item data, comprising:
searching a plurality of item data in a memory unit when a search request requesting a search for item data in with designation of a keyword corresponding to the item data is received from a terminal device, and if number of hit item data exceeds a predetermined number, re-searches the hit item data after shortening a search period;
sorting the hit item data or re-hit item data by date; and
outputting data sorted by the sorting unit to the terminal device.
8. The method according to claim 7, wherein when the search request received contains no search period, the searching includes searching for item data having the designated keyword out of the item data with dates within a predetermined first period, and if number of hit item data exceeds a predetermined number, re-searches the hit item data within a predetermined second period that is within and shorter than the predetermined first period.
9. The method according to claim 7, wherein when the search request contains a search period, the searching includes searching the item data having the designated keyword out of the item data having dates within the search period.
10. The method according to claim 7, wherein when the number of the re-hit item data exceeds a predetermined number, the searching includes repeatedly re-searching for item data while shortening the search period until number of the re-hit item data is less than the predetermined number.
11. The method according to claim 7, wherein the search period includes a search start date and a search end date, and
when the number of the hit item data exceeds the predetermined number, the searching includes shortening the search period by shifting the search start date based on number of days of the search period, number of data that can be displayed on the terminal device, and the number of the item data.
12. The method according to claim 7, wherein the search period includes a search start date and a search end date, and
when the number of the hit item data exceeds the predetermined number, the searching includes shortening the search period by shifting the search end date based on number of days of the search period, number of data that can be displayed on the terminal device, and the number of the item data.
13. A computer-readable recording medium that stores therein a computer program that causes a computer to execute:
searching a plurality of item data in a memory unit when a search request requesting a search for item data in with designation of a keyword corresponding to the item data is received from a terminal device, and if number of hit item data exceeds a predetermined number, re-searches the hit item data after shortening a search period;
sorting the hit item data or re-hit item data by date; and
outputting data sorted by the sorting unit to the terminal device.
14. The computer-readable recording medium according to claim 13, wherein when the search request received contains no search period, the searching includes searching for item data having the designated keyword out of the item data with dates within a predetermined first period, and if number of hit item data exceeds a predetermined number, re-searches the hit item data within a predetermined second period that is within and shorter than the predetermined first period.
15. The computer-readable recording medium according to claim 13, wherein when the search request contains a search period, the searching includes searching the item data having the designated keyword out of the item data having dates within the search period.
16. The computer-readable recording medium according to claim 13, wherein when the number of the re-hit item data exceeds a predetermined number, the searching includes repeatedly re-searching for item data while shortening the search period until number of the re-hit item data is less than the predetermined number.
17. The computer-readable recording medium according to claim 13, wherein the search period includes a search start date and a search end date, and
when the number of the hit item data exceeds the predetermined number, the searching includes shortening the search period by shifting the search start date based on number of days of the search period, number of data that can be displayed on the terminal device, and the number of the item data.
18. The computer-readable recording medium according to claim 13, wherein the search period includes a search start date and a search end date, and
when the number of the hit item data exceeds the predetermined number, the searching includes shortening the search period by shifting the search end date based on number of days of the search period, number of data that can be displayed on the terminal device, and the number of the item data.
19. A terminal device for searching item data that communicates with a server for searching item data having a memory unit storing item data corresponding to item data of periodicals, comprising:
a search requesting unit that sends a request for a search under conditions with designation of a keyword to the server;
a search result receiving unit that receives results of a search conducted by the server, wherein in response to the search request from the search requesting unit, the server searches a plurality of item data in the memory in the server using the keyword, and if a number of the searched item data exceeds a predetermined number, re-searches the searched item data after shortening a search period; and
a displaying unit that displays the results of the search received by the search result receiving unit
Description
    BACKGROUND OF THE INVENTION
  • [0001]
    1) Field of the Invention
  • [0002]
    The present invention relates to a server, method, program, and terminal device for searching item data that store item data corresponding to items of periodicals such as newspaper and magazines.
  • [0003]
    2) Description of the Related Art
  • [0004]
    Item searching services to perform search of items of newspapers and magazines through the internet have been known. Conventionally, when a user sends a request, with a keyword, for a search for searching an item to an item search server, the item search server searches through the memory unit using the keyword, sorting all the hit item data by, for example, date, and provides a predetermined number of newest item data. In many cases, the predetermined number is set to about several tens cases that can be displayed in a window (page) on a display of the user.
  • [0005]
    All the hit data are sorted by, for example, date because new items of newspapers and magazines are constantly generated day by day and it-is highly likely that a number of items that cannot be displayed on the display hit.
  • [0006]
    One example of the conventional technology to sort all the hit data is sorting all the cases that are hit in the database in the order of higher similarity as disclosed in Japanese Patent Application Laid-Open Publication No. H09-73464. This technology is widely adopted as disclosed in various patent documents other than Japanese Patent Application Laid-Open Publication No. H09-73464.
  • [0007]
    However, the process of sorting-the entire hit item data and narrowing down the data to be provided by limiting to some newest item data from among the hit item data requires much time for the sorting, with the result that efficient searching cannot be performed.
  • [0008]
    Among the various processes the item search server carries out, such as session establishing, searching, and sorting, the most influenced by the number of item data is the sorting. The more the number of item data searched in the memory unit, the more the time required for sorting the item data and hence the more the delay in the sorting, leading to a decrease in the efficiency of the search. The processes other than the sorting do not take much time even if the number of the item data is large.
  • SUMMARY OF THE INVENTION
  • [0009]
    It is an object of the present invention to at least solve the problems in the conventional technology.
  • [0010]
    According to an aspect of the present invention a server for searching item data includes a memory unit that stores item data corresponding to items of periodicals; a searching unit that searches a plurality of item data in the memory unit when a search request requesting a search for item data in with designation of a keyword corresponding to the item data is received from a terminal device, and if number of hit item data exceeds a predetermined number, re-searches the hit item data after shortening a search period; a sorting unit that sorts the hit item data or re-hit item data by date; and an outputting unit that outputs data sorted by the sorting unit to the terminal device.
  • [0011]
    According to another aspect of the present invention a method for searching item data includes searching a plurality of item data in a memory unit when a search request requesting a search for item data in with designation of a keyword corresponding to the item data is received from a terminal device, and if number of hit item data exceeds a predetermined number, re-searches the hit item data after shortening a search period; sorting the hit item data or re-hit item data by date; and outputting data sorted by the sorting unit to the terminal device.
  • [0012]
    According to still another aspect of the present invention a computer-readable recording medium stores therein a computer program that causes a computer to the above method according to the present invention.
  • [0013]
    The other objects, features, and advantages of the present invention are specifically set forth in or will become apparent from the following detailed description of the invention when read in conjunction with the accompanying drawings.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • [0014]
    FIG. 1 is a block diagram of an item data searching system according to an embodiment of the present invention;
  • [0015]
    FIG. 2 is a flowchart of the process procedures performed by a terminal device and a server shown in FIG. 1;
  • [0016]
    FIG. 3 is a diagram of an example of an index search page;
  • [0017]
    FIG. 4 is a detailed flow chart of an index search process shown in FIG. 2; and
  • [0018]
    FIG. 5 is a detailed flowchart of preparing a narrowing down search formula shown in FIG. 4.
  • DETAILED DESCRIPTION
  • [0019]
    Exemplary embodiments of a server, a method, program, and a terminal device for searching item data according to the present invention are explained in detail below with reference to the accompanying drawings. An embodiment of the present invention relates to an item data search system that operates on a World Wide Web (hereafter, WWW), which is one of distributed systems on the internet and the case in which indices of the items of newspapers and magazines are provided is explained.
  • [0020]
    First, the configuration of the item data search system according to the present embodiment is explained. FIG. 1 is a functional block diagram of the item data search system according to the present embodiment. The item data search system includes terminal devices 10 a, 10 b, and 10 c and a WEB server 12. The terminal devices 10 a to 10 c and the WEB server 12 are connected through the Internet 11.
  • [0021]
    The terminal devices 10 a to 10 c are installed with a WEB browser capable of having access to a hypertext transport protocol (HTTP) server and can have access to various server devices on the Internet, for example, via internet service providers. More particularly, the terminal devices 10 a to 10 c have a function to request a search to the WEB server 12 for searching an index data of an item on which the keyword is designated. The WEB server 12 conducts a search for a plurality of index data using the keyword and when the number of the searched index data exceeds a predetermined number, conducts again a search for the item data after shortening the search period. The terminal devices 10 a to 10 c have a function to receive results of the search conducted by the WEB server 12 and display the result of the search. These functions are realized by a web browser.
  • [0022]
    The WEB server 12 is an HTTP server that is accessed by the various terminal devices 10 a to 10 c on the internet and provides a web service such as home page. The WEB server 12 provides not only a general web service but also stores index data of newspapers and magazines in the memory unit 123 and when the request for search is received from the terminal devices 10 a to 10 c with designation of the keyword is received, conducts a search for the item data corresponding to the keyword in the memory unit 123 and outputs the results of search to the terminal devices 10 a to 10 c.
  • [0023]
    More particularly, the WEB server 12 does not sort by date all the index data obtained by the search conducted using the keyword as is done in the conventional technology. Instead, the WEB server 12 conducts a search again after shortening the search period to reduce the number of indices when the number of index data searched exceeds a predetermined number, and then sorts the index data by date, thereby reducing the load of the sorting.
  • [0024]
    As shown in FIG. 1, the WEB server 12 includes an interface unit 120, an inputting unit 121, a displaying unit 122, a memory unit 123, and a control unit 124. The interface unit 120 is a network interface that transmits data to and receives data from the terminal devices 10 a to 10 c through the internet 11. More particularly, the interface unit 120 performs the process according to the TCP/IP protocol.
  • [0025]
    The inputting unit 121 is an inputting device, for example, a keyboard or a mouse. The displaying unit 122 is a display device such as a liquid crystal panel or display. The memory unit 123 is a memory device such as a hard disk device. The memory unit 123 stores hypertext 123 a and index data 123 b. The portion that stores the index data 123 b forms a database for the items.
  • [0026]
    The hypertext 123 a is a hypertext for forming a page screen image that is distributed to the terminal devices 10 a to 10 c. The index data 123 b are index data of items of newspapers and magazines. The index data 123 b are obtained on-line from the servers of newspaper publishers to which subscription has been made in advance or off-line using a medium such as a compact disk read only memory (CD-ROM).
  • [0027]
    The control unit 124 controls the whole system of the WEB server 12 that provides index data of items and includes a server processing unit 124 a, an index data searching unit 124 b, and a sorting unit 124 c.
  • [0028]
    The server processing unit 124 a provides the function of an HTTP server to the terminal devices 10 a to 10 c and more particularly, reads the hypertext 123 a stored in the memory unit 123 when accessed by the terminal devices 10 a to 10 c and performs, for example, transmission process to transmit the read hypertext 123 a to the corresponding terminal devices 10 a to 10 c.
  • [0029]
    The index data searching unit 124 conducts a search for a plurality of index data 123 b in the memory unit 123 using the keyword and conducts a search again after shortening the search period when the number of searched index data exceeds the predetermined number. The reason that a reduction in the number of index data is performed by such a re-searching is that the greater the number of the index data the more delayed the sorting of the searched data by the sorting unit 124 c.
  • [0030]
    More particularly, for example, a search period of two years is set in advance and when a request for search without designation of the search period is received from the terminal devices 10 a to 10 c, a search using the keyword is performed for a search period of 2 years. If the number of the hit index data exceeds the predetermined number, the date for starting the search and the date for ending the search are shifted based on the number of days in the search period (2 years=730 days), the number of index data that can be displayed on the terminal devices 10 a to 10 c, and the number of hit index data to restrict the search period, and then a search is conducted again. If the number of the hit index data by this re-search exceeds the predetermined number, a re-search is conducted after shortening the search period in a similar manner. When a request for a search with designation of the search period is received and if the number of the hit index data exceeds the predetermined number, a re-search is conducted after shortening the search period in a similar manner.
  • [0031]
    The sorting unit 124 c sorts by date the hit index data searched by the index data searching unit 124 b. Since the index data searching unit 124 b controls the number of the index data, the sorting unit 124 c need not sort a large number of the index data. The sorted index data 123 b are output as a hypertext to the terminal devices 10 a to 10 c through the server processing unit 124 a.
  • [0032]
    The process procedure performed between the terminal device 10 a and the WEB server 12 is explained in detail. FIG. 2 is a flowchart of the process procedure performed between the terminal device 10 a and the WEB server 12 shown in FIG. 1.
  • [0033]
    When a WEB browser is booted on the terminal device 10 a and access is made to the WEB server 12 through the internet 11 (step S201), the WEB browser 12 prepares a main menu (not shown) (step S202), and displays the main menu on the terminal device 10 a.
  • [0034]
    When a search for index is selected on the main menu (step S203), the selection is notified to the WEB server 12 and the WEB server 12 provides an index search page (step S204). The index search page is displayed on the terminal device 10 a. FIG. 3 is an exemplary index search page 300 that includes a region for setting search conditions, having a keyword inputting frame 301, a date inputting frame 302, and a button 303 for instructing start of search.
  • [0035]
    When a user inputs a keyword and a search period on the index search page 300 to instruct start of the index search (step S205), the searching unit 124 b of the WEB server 12 carries out an index search (step S206). When the user inputs no search period, the index search is carried out by setting a predetermined period (for example, two years) as the search period. If the number of the hit index exceeds a predetermined number, a re-search is carried out by shortening the search period.
  • [0036]
    Display data is prepared based on the results of the index search (step S206), the prepared display data is transmitted to the terminal device 10 a (step S208), and the display data is displayed on the terminal device 10 a as the result of the search.
  • [0037]
    The process procedure for carrying out the index search shown in the Step S206 in FIG. 2 is explained in more detail. FIG. 4 is a detailed flowchart of the process procedure for carrying out the index search shown in the Step S206 in FIG. 2.
  • [0038]
    The index data searching unit 124 b of the WEB server 12 is first initialized to set a variable, n, that indicates the times of search to 0 (zero) (step S401), prepares an initial search formula based on the keywords designated by the terminal devices 10 a to 10 c (step S402), and conducts a search to search the index data 123 b in the memory unit 123 using the initial search formula (step S403).
  • [0039]
    The index data searching unit 124 b examines whether the number of hits of the index data (number of index data) is less than a predetermined number (step S404). If the number of hits of the index data is less than the predetermined number (step S404, yes), the sorting unit 124 c sorts the hit index data 123 b by date (step S405).
  • [0040]
    When the number of hits exceeds the predetermined number (step S404, No), the sorting unit 124 c examines whether the variable, n, is less than a predetermined times (step S406). If the number of hits exceeds the predetermined times (step S406, No), the sorting unit 124 c sorts the index data 123 hit using the initial search formula by date (step S405). That is, in this case, there is a possibility that too much time is required for restriction due to repeated process, so that the repetition is stopped after a predetermined number of times of repetition and the sorting is carried out on the results of initial search.
  • [0041]
    If the variable, n, is less than the predetermined times (step S406, Yes), the variable, n, is incremented (step S407), and a new search formula in which the search period is shortened is prepared (step S408), and system control is passed to step S403.
  • [0042]
    The process procedure for preparing the new search formula shown in step S408 in FIG. 4 is explained below in more detail. FIG. 5 is a detailed flowchart of the process procedure for preparing the new search formula shown in step S408 in FIG. 4.
  • [0043]
    The index data searching unit 124 b of the WEB server 12 calculates the number of days from the start of the search to the end of the search (step S501), and calculates a shortening rate, x (step S502).
  • [0044]
    The index data searching unit 124 b then calculates a product (dx) of the number of days, d, and the shortening rate, x, as a number of shift days (step S503), and sets a date obtained by shifting the previous search start date by the number of shift days as new search start date (step S504). The index data searching unit 124 b prepares a restricted search formula in which the search period is shortened using the new search start date (step S505).
  • [0045]
    In this manner, the number of index data can be reduced to be less than the predetermined number before the sorting by the sorting unit 124 c is carried out. This reduces the time required for the sorting and hence a delay in the processes.
  • [0046]
    A specific algorithm used when the present invention is carried out using a program is explained. The following assumptions are made. “X” designates a coefficient (1 or more) relating to a restricted maximum number of hits; “Y” designates a coefficient (1 or more) relating to restriction of the search period; “pos” designates a display start position; “max” designates a number of displayed items; “start” designates a search start date; “end” designates a search end date; “keyquery” designates a search formula disregarding the search period; “n” designates a number of times of restricted search; “query(n)” designates a search formula when an n-th time search is conducted; “hits(n)” designates a number of hits when a search is conducted using the query(n); “start(n)” designates a search start date when an n-th time restricted search is conducted; and “end(n)” designates a search end date when an n-th time restricted search ends.
  • [0047]
    When an initial search formula is prepared,
    start(0)=start,
    end(0)=end,
    query(0)=keyquery AND “item date>start(0)” AND “item date<end(0)”.
  • [0048]
    When a new search formula is prepared by shifting the search start date,
    date obtained by subtracting {(a difference between end(n−1) and start(n−1)(max+pos)/hits(n−1)Y} from start (n)=end(n−1)
    end(n)=end(n−1)
    if start>start(n), then start(n)=start
    if end<end(n−1), then end(n)=end
    If end<end(n), then end(n)=end
    query (n) keyquery AND “item date>start(n)” AND “item date<end(n)”.
  • [0049]
    When a new search formula in which restriction is performed by shifting the search end date,
    start(n)−start(n−1)
    date obtained by adding {(a difference between end(n−1) and start(n−1)(max+pos)/hits(n−1)Y} to end (n)=start(n−1)
    If start>start(n), then start(n)=start
    If end<end(n), then end(n)=end
    query(n)=keyquery AND “item date>start(n)” AND “item date<end(n)”.
  • [0050]
    A specific example of judgment of number of hits when the above-mentioned formula is used and date of re-search is explained in more detail. Assumptions are made as follows. The search start date is Jan. 1, 2001 and the search end date is Jan. 1, 2003. The initial number of hits is 5,000. The tuning parameter X for judging number of hits is set 20 folds and the tuning parameter Y for shifting the number of days is 5 folds. When the period is restricted, the search end date is shifted.
  • [0051]
    Judging number of hits,
    (max+pos)X=(20+0)20=400
    is obtained. Since 400<5,000, a period shortening process is carried out.
  • [0052]
    Since the number of days, d, from the search start date to the search end date=730 days,
    dx=730 (730(20/5,000)=3 days.
  • [0053]
    Therefore, the search end date is after (dx)Y=35=15 days from Jan. 1, 2003, i.e., Dec. 18, 2001. Accordingly, when a re-search is carried out, the re-search is carried out for a shortened search period of from Jan. 1, 2001 to Dec. 18, 2002.
  • [0054]
    When a request for a search with designating a keyword and a search period on the terminal devices 10 a to 10 c is made, the index data searching unit 124 b of the WEB server 12 searches a plurality of index data 123 b in the memory unit 123 using the keyword. When the number of the hit index data exceeds the predetermined number, a re-search is conducted after shortening the search period and the sorting unit 124 c sorts by date the index data 123 b hit by the index data searching unit 124 b. Accordingly, the delay due to sorting when index data of items in newspapers and magazines and so on can be reduced, thereby enabling an efficient search of the item data.
  • [0055]
    In the above, the present invention is applied to the case where WWW on the Internet is used. However, the present invention is not limited to this and may be realized by using an exclusive use network.
  • [0056]
    Moreover, in the above, the case where index data of newspapers and magazines are target for search is explained. However, the present invention is not limited to this and may be applied to the case where the item data themselves are searched.
  • [0057]
    Furthermore, in the above, the case where repeated restrictions are performed by re-searching is explained. However, the present invention is not limited to this and may be applied to the case where a research is conducted with broadening the search period when the number of hits is small.
  • [0058]
    According to the present invention, a plurality of item data are searched in the memory unit using a keyword and when the number of the hit index data exceeds a predetermined number, a re-search of the item data is conducted after shortening the search period, and the hit or re-hit item data are sorted by date. Accordingly, the delay in the processes due to the sorting when the item data of newspapers, magazines and so on are hit can be reduced, thereby enabling an efficient search of the item data.
  • [0059]
    According to the present invention, when a search request containing no search period in search conditions is received from a terminal device, item data having corresponding keywords are searched in the item data having date within a predetermined period, and if a number of the hit item data exceeds a predetermined number, a re-search of the item data is performed after shortening the predetermined period. Accordingly, when no search period is designated, a re-search is performed with appropriately shortening the search period and the delay in the processes that occurs when searching item data of newspapers, magazines and so on due to sorting can be reduced.
  • [0060]
    According to the present invention, when a search request containing a search period in search conditions is received from a terminal device, item data having corresponding keywords are searched in the item data having date within the search period, and if a number of the hit item data exceeds a predetermined number, a re-search of the item data is performed after shortening the search period. Accordingly, the re-search is performed with appropriately shortening the search period designated by the user and the delay in the processes that occurs when searching item data of newspapers, magazines and so on due to sorting can be reduced.
  • [0061]
    According to the present invention, when the number of re-hit item data exceeds a predetermined number, re-search is repeated until the number of hit item- data is less than the predetermined number after shortening the search period. Accordingly, the number of item data can be limited to maximum the predetermined number, so that the sorting can be accelerated.
  • [0062]
    According to the present invention, when the number of the hit item data exceeds a predetermined number, the search period is shortened by shifting the search start date based on the number of days of the search period, the number of the item data that can be displayed on the terminal device, and the number of the item data. Accordingly, the search start date can be flexibly and properly changed depending on the number of days of the search period, the number of the item data that can be displayed on the terminal device, and the number of the item data.
  • [0063]
    According to the present invention, when the number of the hit item data exceeds a predetermined number, the search period is shortened by shifting the search end date based on the number of days of the search period, the number of the item data that can be displayed on the terminal device, and the number of the item data. Accordingly, the search end date can be flexibly and properly changed depending on the number of days of the search period, the number of the item data that can be displayed on the terminal device, and the number of the item data.
  • [0064]
    According to the present invention, a search request with designation of a keyword is made to the item data search server, which in response to the search request, searches a plurality of item data using the keyword, and when the number of the hit item data exceeds a predetermined number, re-searches the item data after shortening the search period, and results of the search are received and controlled for display by the terminal device. Accordingly, an appropriate number of the hit item data can be displayed on the terminal device.
  • [0065]
    Although the invention has been described with respect to a specific embodiment for a complete and clear disclosure, the appended claims are not to be thus limited but are to be construed as embodying all modifications and alternative constructions that may occur to one skilled in the art that-fairly fall within the basic teaching herein set forth.
Patent Citations
Cited PatentFiling datePublication dateApplicantTitle
US6029195 *Dec 5, 1997Feb 22, 2000Herz; Frederick S. M.System for customized electronic identification of desirable objects
US6055542 *Oct 29, 1997Apr 25, 2000International Business Machines CorporationSystem and method for displaying the contents of a web page based on a user's interests
US6101503 *Mar 2, 1998Aug 8, 2000International Business Machines Corp.Active markup--a system and method for navigating through text collections
US6363377 *Dec 22, 1998Mar 26, 2002Sarnoff CorporationSearch data processor
US6421675 *Jul 15, 1998Jul 16, 2002S. L. I. Systems, Inc.Search engine
US6999959 *Jul 10, 1998Feb 14, 2006Nec Laboratories America, Inc.Meta search engine
US20020078025 *Oct 30, 2001Jun 20, 2002Seiko Epson CorporationSystems and methods for information searching
US20020165925 *Mar 8, 2001Nov 7, 2002International Business Machines CorporationPredictive caching and highlighting of web pages
US20030014501 *Jul 10, 2001Jan 16, 2003Golding Andrew R.Predicting the popularity of a text-based object
US20030023745 *Jul 26, 2001Jan 30, 2003Neoplanet, Inc.Method and system for adaptively downloading data from a network device
Referenced by
Citing PatentFiling datePublication dateApplicantTitle
US7730013Oct 25, 2005Jun 1, 2010International Business Machines CorporationSystem and method for searching dates efficiently in a collection of web documents
US8065288Nov 9, 2007Nov 22, 2011Nvidia CorporationSystem, method, and computer program product for testing a query against multiple sets of objects utilizing a single instruction multiple data (SIMD) processing architecture
US8243083Dec 11, 2008Aug 14, 2012Nvidia CorporationSystem, method, and computer program product for converting a scan algorithm to a segmented scan algorithm in an operator-independent manner
US8264484Oct 29, 2007Sep 11, 2012Nvidia CorporationSystem, method, and computer program product for organizing a plurality of rays utilizing a bounding volume
US8284188Oct 29, 2007Oct 9, 2012Nvidia CorporationRay tracing system, method, and computer program product for simultaneously traversing a hierarchy of rays and a hierarchy of objects
US8321492Dec 11, 2008Nov 27, 2012Nvidia CorporationSystem, method, and computer program product for converting a reduction algorithm to a segmented reduction algorithm
US8661226Nov 15, 2007Feb 25, 2014Nvidia CorporationSystem, method, and computer program product for performing a scan operation on a sequence of single-bit values using a parallel processor architecture
US8773422Dec 4, 2007Jul 8, 2014Nvidia CorporationSystem, method, and computer program product for grouping linearly ordered primitives
US8996846Sep 27, 2007Mar 31, 2015Nvidia CorporationSystem, method and computer program product for performing a scan operation
US20070094246 *Oct 25, 2005Apr 26, 2007International Business Machines CorporationSystem and method for searching dates efficiently in a collection of web documents
US20080010754 *Jul 11, 2007Jan 17, 2008The Procter & Gamble CompanyGel network surfactant based thickening systems for hair colourant and bleaching compositions
US20090132878 *Nov 15, 2007May 21, 2009Garland Michael JSystem, method, and computer program product for performing a scan operation on a sequence of single-bit values using a parallel processor architecture
Classifications
U.S. Classification1/1, 707/E17.108, 707/999.003
International ClassificationG06F17/30
Cooperative ClassificationG06F17/30864
European ClassificationG06F17/30W1
Legal Events
DateCodeEventDescription
Apr 13, 2005ASAssignment
Owner name: FUJITSU LIMITED, JAPAN
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:KOBAYASHI, TETSUSHI;ODA, TOSHIHIKO;IMAJIMA, YOSHIAKI;REEL/FRAME:016476/0599
Effective date: 20050228