JP2002189880A - Information transmitting and supporting method and device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To support a person desiring to transmit information to an information communication network, to exhibit information and to increase accesses desiring to receive the exhibition information. SOLUTION: A digital atelier 10 performs supports such as instructions at a school and contents providing till a DA member 11 as a branch enterprise opens a shop home page 25 on the Internet 17. After the opening, the DA member 11 updates article information by himself. The digital atelier 10 performs supports to make the article information be recognized by more people and to link ordering of the article. A retrieving system by a mechanism of a key and a lock is prepared for an access via the Internet 17, a point system is combined, and consumer and article are linked.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an information transmission support method and apparatus for disclosing information on an information communication network so as to effectively transmit information to a person who wants to transmit the information widely.

[0002]

2. Description of the Related Art In recent years, with the development of information communication means, various types of information have been transmitted using a wide-area information communication network such as the Internet. In particular, WEB
If you send information in a form called a page,
It can be easily browsed by software called WEB browser which is widely used. When sending information using the Internet, we publish information free of charge for publicity and advertising, or to assert or announce some kind of opinion, build a virtual product sales store on the Internet, and pay There are also businesses that sell.

FIG. 43 shows an outline of the prior art disclosed in Japanese Patent Application Laid-Open No. 10-320777. In this prior art, a virtual shopping mall as a virtual store is constructed on the mall server 1. The mall server 1 is connected to the information communication network 2, and is also connected to the terminal device 4 of the branch company 3 that sells various products to consumers in the virtual shopping mall via the information communication network 2.
The agent company 5 acting on behalf of the store opening company 3 also has a terminal device 6 connected to the information communication network 2. The opening company 3 and the agency company 5 register an ID code as identification information in the table 7 in advance, and open the opening company homepage 8
Registered in the table 7 for the product information 9 of
Editing is possible if you show the D code. ID in Table 7
When the code is not registered, even if the user accesses the branch company homepage 8, only the product information 9 can be browsed.

[0004] The agent company 5 registers the ID code in the table 7 in advance, and replaces the store company 3 with the product information 9.
Can be edited. Therefore, the opening company 3 that entrusts the agency company 5 with tasks such as editing the product information 9 and obtaining order information does not need to teach the agency company 5 its ID code, and the agency company 5 also uses the ID code based on its own. To access the store opening company homepage 8. In such prior art, the store opening company 3 can leave the agent company 5 to manage the merchandise information 9 in the mall server 1 and the like, thereby saving labor.

[0005]

Problems to be Solved by the Invention
According to the prior art disclosed in Japanese Patent No. 77, the branch company 3 that once exhibited the product information 9 on the branch company homepage 8 of the mall server 1 can leave the subsequent management and the like to the agency company 5. However, the opening company homepage 8
Needs to be established by the opening company 3 itself. Today, a lot of information is transmitted through the Internet, and there are many virtual shopping malls. Therefore,
Simply providing the store opening company homepage 8 and publishing the product information 9 does not necessarily mean that consumers will use it. For this reason, in creating the store opening company homepage 8, it is necessary to provide attractiveness that the viewer is interested in. In addition, the mall server 1 itself needs to be contrived to increase the chances of browsing.

[0006] There are many applicants for transmitting information through the Internet, such as those who want to release their own video works and those who do business by establishing an electronic store.
Applicants wishing to transmit video works may be proficient in creating video works using digital cameras and camcorders, but may have little knowledge of computers and the Internet. In addition, those who wish to conduct business through the Internet often lack knowledge of computers and the Internet. Therefore, when publishing a video work on the Internet or performing a business by connecting an electronic store or the like, the following difficulties must be prepared.

[0007] Lack of knowledge and means of connecting to the Internet. As a terminal device for connecting to the Internet, it is necessary to provide, for example, means such as a personal computer. Also, joining a provider or the like is necessary as a means of accessing the Internet. Furthermore, in order to know the methods necessary for releasing works and establishing a store, it is necessary to read various manuals and study on their own, or take correspondence courses or go to school.

[0008] Insufficient content. In order to be able to receive more access on the Internet where a lot of information is transmitted, we will make titles, wallpapers,
It is necessary to add a character etc. To do this, find and purchase the appropriate ready-made content package,
It is necessary to ask a specialized design company to make it.

[0009] Difficulty of recognition. The benefit of publishing on the Internet is that it can be seen by many people. However, in order to be seen by many people, it is necessary to have their works and stores recognized. As a means of doing this,
It is conceivable to place an advertisement on a frequently accessed site or register it on a search site. These have problems such as high cost and difficulty in sufficiently reflecting the author's intention.

[0010] An object of the present invention is to provide a caller who has little knowledge of computers and information communication networks with a caller.
An object of the present invention is to provide an information transmission support method and apparatus for supporting a user to receive many accesses.

[0011]

SUMMARY OF THE INVENTION According to the present invention, a request is received from a transmission applicant who wishes to transmit information on an information communication network, and the information is provided with a search lock for convenience when searching. Information is created for a fee, displayed on the digital atelier as a site accessible from the information and telecommunications network, and released to the public. Is registered, and based on the registered preferences, a search key for searching for exhibition information using a search lock is generated, and for those who wish to access the digital studio, a search key is generated. Receiving the exhibition information to which the search lock matching the search key is added, and performing a predetermined action on the received exhibition information, The recipient can obtain a prize according to the number of obtained prize points, and can request a fee corresponding to the number of prize points presented to the recipient to transmit the exhibition information on which the act was performed. An information transmission support method characterized by charging a user.

According to the present invention, upon receiving a request from a person who wants to transmit information on the information communication network, a search lock for convenience at the time of search is added to the information to create exhibition information for a fee. Even if a person who wants to transmit information has little knowledge of computers and information communication networks, he or she can have the exhibition information created by paying a fee, and the information can be transmitted. The created exhibition information will be exhibited and released in the digital atelier as a site accessible from the information and communication network. The applicant who wants to receive the exhibition information to access the digital atelier from the information communication network is asked to register his / her preference as the basis of the information search. Based on the registered preference, a search key for searching for the exhibition information is formed using the search lock added to the exhibition information. The reception applicant is caused to receive exhibition information to which a search lock matching the formed search key is added. Since the reception applicant can receive the exhibition information that matches the registered preference, it becomes possible to receive the desired exhibition information in a short time and effort.

[0013] A prize point is awarded to a person desiring to receive the exhibition information on condition that a predetermined action is performed on the received exhibition information. Those who wish to receive
Since prizes can be obtained in accordance with the number of obtained prize points, it is a powerful motivation to receive exhibition information from the digital atelier. We will charge the applicant for the exhibition information a fee according to the number of prize points presented to the applicant, so we will receive a lot of access and will be rewarded for the results of performing predetermined actions on the transmitted exhibition information Can be obtained. In other words, if you create exhibition information that can be accessed a lot, you will get a lot of rewards. Can be.

[0014] In the present invention, the exhibition information is a work of the transmission applicant that the reception applicant can receive free of charge,
As the predetermined action, the reception applicant leaves a comment on the received work.

According to the present invention, a caller who wants to release his or her work via an information communication network,
You can have the exhibition information created and displayed in the digital atelier and made public. For example, even if a digital camera or a video camera is owned and used, it is difficult to exhibit and transmit works on an information communication network such as the Internet. The digital atelier will add a search lock to the information that the applicant wants to send and display it. Exhibit information accessed via the network can be displayed in the digital atelier and motivated to leave comments.

Further, in the present invention, the exhibition information relates to a product purchased by the person desiring to receive a fee, and as the predetermined action, the person desiring to purchase the product is purchased based on the received information. It is characterized by the following.

According to the present invention, a person who wants to transmit exhibition information on a product in order to sell the product publishes the exhibition information on the product in a digital atelier and acts in advance on the exhibition information to be disclosed, for example, a product. Is purchased, a prize point is given to the purchaser, and a fee corresponding to the prize point is charged to the caller. Since the fee will be paid according to the number of prize points according to the sale of the product, the applicant for transmission can expect that the product will be sold with much access by having the exhibition information created .

Further, the present invention is characterized in that the registration of the preference as the basis of the information search is performed by asking the person desiring to receive information about a predetermined matter and based on the answer to the question.

According to the present invention, a preference serving as a basis for information retrieval can be registered by a response in the form of a question to a person who wants to receive information displayed in the digital atelier. Recipients simply answer simple questions,
Information can be efficiently obtained by narrowing the range of the exhibition information to be received from the information displayed in the digital atelier.

Further, in the present invention, the search key is created by including general elements including age, generation, recent trend, etc. together with the registered preference.

According to the present invention, a search key used when searching for information displayed in the digital atelier is a general key including age, generation, recent fashion, etc., together with registered tastes. Since such information is created by including various elements, it is possible to perform an appropriate information search including general elements in addition to the preference expressed by the person desiring to receive the information.

[0022] In the present invention, the sending applicant is provided with hardware and software necessary for creating the exhibition information for a fee, and the search lock is added to the created exhibition information. It is characterized by exhibiting.

According to the present invention, the hardware and software necessary for creating the exhibition information are provided to those who wish to transmit the exhibition information for a fee. Effective support can be provided.

In the present invention, the identification information is issued to the person desiring reception at the time of registration of the basic preference, and at the time of accessing the digital atelier from the information transmission network, the person desiring reception receives the identification information. Is used, a search key based on the preference registered corresponding to the identification information is used.

According to the present invention, identification information is issued to a person desiring to receive at the time of registration of a preference serving as a basis for information retrieval. If the candidate who wishes to receive presents the identification information the next time he accesses the digital atelier, the information search is performed using the search key based on the preference registered corresponding to the identification information. With this access, there is no need to register preferences again in a question format. Recipients can obtain identification information on their own preferences, and also register and receive the preferences of gift recipients such as gifts.

Further, the present invention provides a digital atelier accessed from an information communication network, in which a plurality of pieces of information are added as search locks for convenience of search and published as exhibition information. Receiving the access to the information, obtaining information about the preferences that are the basis of the information search from the recipients of the exhibition information and registering the preferences, and searching for the exhibition information based on the registered preferences. A step of generating a search key, a step of searching for exhibition information to which a search lock matching the generated search key is added, and a step of receiving the exhibition information to a recipient, Providing a prize point on condition that a predetermined action is performed on the information, and giving a prize in accordance with the number of prize points acquired by the recipient; Recording a program for causing a computer to execute a process of charging a fee corresponding to the number of prize points presented to a recipient of the exhibition information to a person who wants to transmit the exhibition information disclosed in the atelier. It is a computer-readable recording medium.

According to the present invention, a computer is operated to invite solicitation for access to information published in a digital atelier by providing a prize, and exhibition information is received by a large number of people who wish to receive the information and a predetermined action is performed. A system can be easily constructed by a program operation of a computer in which a fee corresponding to the access result can be obtained by charging a fee according to the number of prize points on the condition that the program is performed.

[0028] Further, the present invention provides an information publishing means for displaying exhibition information to which a search lock is added for convenience at the time of search on a site accessible from the information communication network and publishing it as a digital atelier; For those who wish to receive the exhibition information that accesses the digital atelier of the information disclosure means, accept and register the preferences that are the basis of the information search, and, based on the registered preferences, display the exhibition information using a search lock. Search key generation means for generating a search key for searching, the information disclosure means searches for a search lock that matches the search key generated by the search key generation means, and Upon receiving the exhibition information with the search lock attached, and giving a predetermined action to the exhibition information to be received, give away prize points and request reception The fee in accordance with the premium number of points was awarded to an information dissemination support device, characterized in that it performs the processing of claims to the desired call's exhibition information which the act has been performed.

According to the present invention, the information transmission support device includes:
An information disclosure unit and a search key generation unit are included. The information disclosure means receives a request from a person who wants to transmit information on the information communication network, and creates a display information by adding a search lock for convenience at the time of search. Even if a person who wants to transmit information has little knowledge of computers and information communication networks, he can have the information disclosure means create exhibition information and transmit information. The created exhibition information is exhibited as a digital atelier on a site accessible from the information communication network and is disclosed by the information disclosure means. For the applicant who wants to receive the exhibition information accessing the digital atelier from the information communication network, the preference as the basis of the information search is registered in the search key generation means. The search key generating means generates a search key for searching for the exhibition information using the search lock added to the exhibition information based on the registered preference. The information publishing means causes the recipient to receive the exhibition information to which the search lock matching the generated search key is added. Since the reception applicant can receive the exhibition information that matches the registered preference, it becomes possible to receive the desired exhibition information in a short time and effort.

[0030] For a person who wants to receive the exhibition information, a prize point is presented from the information disclosure means on condition that a predetermined action is performed on the received exhibition information. Recipients can obtain prizes according to the number of obtained prize points, which is a powerful motivation to receive exhibition information from the digital atelier of the information disclosure means. Since the information disclosure means charges a fee corresponding to the number of prize points presented to the applicant for the reception to the applicant for transmitting the exhibition information, a large number of accesses have been received, and a predetermined act has been performed on the transmitted exhibition information. You can get rewards for achievements. Providing a reward can be effective in supporting the caller.

[0031] In the present invention, the information publishing means publishes, as the exhibition information, a work of the caller who is free to receive by the receiver and a product purchased by the receiver for a fee. Then, as the predetermined action, the requester is requested to leave a comment on the work and purchase the product based on the received reception information.

According to the present invention, in the digital atelier of the information disclosure means, the work of the transmission applicant who can receive the information free of charge and the products purchased by the reception applicant for a fee are disclosed. If you leave a comment or purchase a product, you will receive a free gift point. The presentation of the prize points motivates the recipient to receive the exhibition information, and can assist the recipient to access the information to be transmitted more.

Further, the present invention provides an exhibition server for displaying a plurality of pieces of exhibition information together with a search lock for convenience in searching in a digital atelier accessed from the information communication network, and an access to the digital atelier from the information communication network. A receiving portal server,
Preference registration means for acquiring information about preferences serving as a basis for information search from applicants of exhibition information and registering the preferences, and a search for searching for the exhibition information based on the preferences registered in the preference registration means Search key generating means for generating a key; searching for exhibition information to which a search lock compatible with the generated search key is added from an exhibition server; A prize providing means for giving a prize point on the condition that the recipient wishes to perform a predetermined action on the received exhibition information and giving a prize according to the number of prize points acquired by the recipient, and a digital atelier. Charge requesting means for charging a fee corresponding to the number of prize points presented by the prize providing means to the applicant for the display information to the applicant who wants to transmit the exhibited information to the public. The information transmitting support device which comprises a Tarusaba.

According to the present invention, upon receiving a request from a person who wants to transmit information on the information communication network, the exhibition server sends the exhibition information provided with a search lock for convenience at the time of search to the digital atelier. Showcase. Even if a person who wants to transmit information has little knowledge of a computer or an information communication network, the exhibition server can display the exhibition information in a digital atelier. For those who wish to receive the exhibition information accessing the digital atelier from the information communication network, the preference registering means of the portal server acquires information about the preference on which information retrieval is based and registers the preference. The search key generation means generates a search key for searching the exhibition information using the search lock added to the exhibition information based on the preference registered in the preference registration means. The search means causes the exhibitor to receive exhibition information to which a search lock matching the search key generated by the search key generation means is added. Since the reception applicant can receive the exhibition information that matches the registered preference, it becomes possible to receive the desired exhibition information in a short time and effort.

[0035] A prize point is presented to a person who wants to receive the exhibition information from the prize providing means of the portal server on condition that a predetermined action is performed on the received exhibition information. Recipients can obtain prizes according to the number of obtained prize points, which is a powerful motivation to receive exhibition information from the digital studio. The fee billing means of the portal server charges the exhibitor with a fee corresponding to the number of prize points presented to the applicant by the prize providing means. A reward can be claimed for the performance of a predetermined action. If you create exhibition information that leads to many achievements, you will get a lot of rewards, so it can be effective to support those who want to display and disclose the information in a digital atelier.

[0036] The present invention is further characterized by further comprising a support server for supporting the creation of the exhibition information to be displayed on the exhibition server by the caller and generating the search lock.

According to the present invention, since the support server supports the creation of the exhibition information to be displayed on the exhibition server, the transmission applicant can easily transmit the information on the information transmission network. The support server also generates a search lock to be added to the exhibition information to facilitate the search of the exhibition information, so that an appropriate search lock can be added.

[0038] In the present invention, the display server may include a library server for displaying the work of the caller who is free to receive by the receiver, and a mall for displaying a product purchased by the receiver for a fee. And a server.

According to the present invention, a person desiring to transmit can exhibit works to be released free of charge on a library server and goods for sale for a fee on a mall server. Can be displayed in such a state. Recipients will be asked to select a work or product,
You can choose between a library server and a mall server.

[0040]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS FIG. 1 shows an outline of an information transmission support method as one embodiment of the present invention. In the present embodiment, information transmission support is performed by a digital atelier (hereinafter, sometimes abbreviated as “DA”) 1 related to the Internet.
It is performed as a business to open 0. The digital atelier 10 has a membership system, and has a cyber space 12 deployed as a site on the Internet and a real space 13 serving as a service providing base outside the Internet.
And can be considered separately. Cyberspace 12
Includes a library for providing personal work information,
A library server 14 opened as an exhibitor HP (Home Page) and the like, and a mall server 15 opened as a store HP as a mall providing merchandise information for selling merchandise are provided. Library server 1
4 and the mall server 15 can be accessed from the Internet 17 via a portal server 16 serving as an entrance. A visitor 18 to the library and a visitor 19 to the mall access the portal server 16.

In the real space 13, a studio 21 in which the DA member 11 works with a support server 20 having a content database and the like prepared in the digital atelier 10, and knowledge and lectures on creation of exhibition information are received. And a school 22 to which contents used for exhibition information are provided. In addition, in the cyberspace 12, a portion that cannot be covered by the mall server 15 in the digital atelier 10 can cooperate with a partner company mall 23 established by another company or the like.

At the school 22, the DA member 11 obtains the knowledge necessary for exhibiting works on the library server 14 and opening a store on the mall server 15 from the basics related to computers and the Internet, according to his / her own level. You can learn while choosing freely. Studio 21
Then, by utilizing the knowledge and the like learned at the school 22, utilizing the prepared terminal and the content database obtained from the support server 20, the work and the product information are uploaded to the library server 14 and the mall server 15, and the library and the store are opened. Opening work can be performed. When uploading work or product information from the support server 20,
A search lock for convenience of search is also added.

The digital atelier 10 provides a portal server 16 to smoothly provide work information and product information exhibited in the library server 14 and the mall server 15 to the library visitor 18 and the mall visitor 19.
Are prepared. The library server 14, the mall server 15, the portal server 16 and the support server 20 are connected to a local area network (LAN) installed in the digital atelier 10.
etwork). The portal server 16 prompts the visitor 18 to the library and the visitor 19 to the mall to register, and at the same time, fills in a profile such as interests and hobbies by a questionnaire method, and registers and stores the profile as a unique key indicating the preference. An identification number is negotiated for the unique key, and if the visitor 18 to the library or the visitor 19 to the mall presents the identification number and accesses it,
By calling this unique key, browsing of works and searching for products can be performed more quickly and efficiently.

The digital atelier 10 prompts the visitor 18 to the library to browse the library established by the library server 14 to leave a comment on the browsed work. In general, for those who wish to display their works on the Internet, those who wish to view the works and leave comments will be expected to respond to the comments from those who wish to transmit their works. In the case of using the digital atelier 10 of the present embodiment, as a reward from the DA member 11, a prize point that can be exchanged for a prize according to the acquired number is presented. The prize points are stored in the portal server 16 together with the unique key. The DA member 11 receives a visitor 18 from the portal server 16 to the library.
A usage fee is charged according to the prize points presented.

That is, when the visitor 18 to the library makes a request for a work search as shown by the Internet 17 and writes a comment as shown by the Internet 17 to the portal server 16, the portal server 16 sends the visitor to the library. 18, the work information is provided through the Internet 17, and the point is provided as indicated by. Further, the portal server 16 performs a work search for the library server 14 as shown in FIG. Further, the portal server 16 provides the DA member 11 with a point providing fee corresponding to the prize point provided to the visitor 18 to the library via the Internet 17 as shown in (1a) of "* 1" described later. Make a claim.

The digital atelier 10 uses not only the unique key of the visitor 19 itself to the mall but also other unique keys for the visitor 19 to the mall searching for the product information in the mall established by the mall server 15. In addition, the use of an arbitrary key prepared in advance in the portal server 16 and the simultaneous use of the unique key and the arbitrary key can be selected.
This is because it is also possible to efficiently search for a gift or the like other than the visitor 19 to the mall from the mall based on criteria different from the preference of the visitor 19 to the mall itself.

When the portal server 16 receives a product search from the visitor 19 to the mall, the portal server 16 searches for the product in the mall server 15 using a search key such as a unique key or an arbitrary key, or a combination of search keys. If an appropriate product is found, the result is introduced to the mall visitor 19 as a recommended product. When the visitor 19 to the mall takes a procedure of ordering recommended products using a predetermined form, a prize point is presented to the visitor 19 to the mall. A fee corresponding to the prize points presented from the portal server 16 to the visitor 19 to the mall is charged to the DA member 11 who wants to transmit information on recommended products.

In the processing performed by the portal server 16,
The process indicated by “* 1” corresponds to the following fee request to the DA member 11. (1a) Point offer fee request (1b) Tablet renewal fee request (1c) Studio / school use fee request The processing indicated by "* 2" is the addition / change of works / products from DA member 11 to portal server 16 Is a lock update request associated with. The process indicated by “* 3” represents the following procedure between the support server 20 and the portal server 16. (3a) Update registration of exhibitor / store / work / product management table (3b) Update registration of authentication table for exhibitor HP / store editing (3c) Update registration of lock management table (3d) Update registration of key and lock contrast management table (3e ) Lock renewal fee, studio / school usage fee

That is, when the visitor 19 to the mall issues a product search request as shown by the Internet server 17 to the portal server 16, the portal server 16 sends the mall visitor 19
In this case, the product information is provided through the Internet 17 and the point is provided as shown in FIG. Also, the portal server 16 is a mall server 15
, A product search as shown by, and a product order as shown by. Further, the portal server 16
As shown in (1a) of the process indicated by "* 1", the DA member 11 is charged via the Internet 17 with a point providing fee corresponding to the premium points provided to the visitor 19 to the mall.

In some cases, merchandise information to be searched for by the visitor 19 to the mall is disclosed in the affiliated company mall 23. In this case, the portal server 16 searches the affiliated company mall 23 for a product search as shown in FIG.
A product order as shown by, and a point provision fee as shown by. Product information is provided from the affiliated mall 23 to the portal server 16 via the Internet.

The DA member 11 can perform the following operations from a terminal provided in the studio 21 or a terminal connected to the Internet 17 by himself / herself. Go to mall server 15 → Confirm order details and add / change products Go to library server 14 → Add / change works Go to portal server 16 → Check comments and provide points for library use

When a work or a product is added or changed by the DA member 11, the notification is also sent to the portal server 16. D
When adding or changing a work or product, the A member 11 also requests the portal server 16 to update the lock with the addition or change of the work or product, as indicated by “* 2”. The portal server 16 requests the support server 20 to update the lock with the addition / change of the work / product received from the DA member 11. Also, when a product is added or changed in the partner company mall 23, the support server 20
At the same time, a lock update request accompanying the addition / change of a product is made via the Internet 17. A lock update fee is charged from the support server 20 to the partner company mall 23 via the Internet 17.

When the support server 20 updates the lock in response to the lock update request from the portal server 16 or the affiliated company mall 23, the support server 20 transmits “* 3” to the library server 14, the mall server 15, and the portal server 16. (3a) to (3e)
Update processing and billing.

In the process from the support server 20, the portal server 16 requests the DA member 11 via the Internet 17 for (1b) and (1c) as indicated by “* 1”.

In the digital atelier 10 having the configuration as described above, the visitors, that is, the visitors 18 to the library and the visitors 19 to the mall, can use the exhibition information published free of charge. In addition, by performing actions that meet certain conditions,
Premium points are obtained, and it is also possible to acquire premiums by exchanging points. From DA member 11 and partner company mall 23 that release works and products to digital atelier 10,
Collect usage fees. The usage fee includes a fee required to release the exhibition information, a fee corresponding to the provision of points, a lock renewal fee, and a studio or school usage fee.

FIG. 2 shows the role assignment of the library server 14 of FIG. The library server 14 displays the exhibitor homepage 24 as a library.
It has a P / work editing authentication management table 14a and performs library management processing 14b. Library management processing 14b
Then, the following processing is performed. Exhibitor / Work Registration Update Certification Table Registration Update Work Call by Exhibitor / Work Number

FIG. 3 shows the role assignment of the mall server 15 in FIG. Mall server 15 is a store homepage 25
Is provided as a mall, a store / article editing authentication management table 15a is provided, and a mall management process 15b is performed. In the mall management processing 15b, the following processing is performed. Store / product registration update Authentication table registration update Product call by store / product number Order registration to store

FIG. 4 shows the role assignment of the portal server 16 of FIG. The portal server 16 serves as an entrance to a visitor accessed via the Internet, and mediates between the DA member 11 and the visitor. The portal server 16 includes a DA member authentication management table 16a for authenticating the DA member 11, and performs portal management processing 16b. In the portal management process 16b, the key management table 26
a, a key temporary storage table 26b, a key creation additional questionnaire temporary table 26c, a large / medium / small category number table 26d, a library point temporary table 26e, a lock management table 26f, a key-to-lock comparison management table 26
g, store / product management table 26h, exhibitor / work management table 26i, point exchange product table 26j, use candidate key table 26k, combination candidate key table 26
l, a medium category candidate value table 26m, a small category candidate value table 26n, a candidate comparison table table 26o, a candidate product table 26p, a candidate work table 26q, a redemption candidate product table 26r, and a point redemption product table 26j, as follows. Process. The key temporary storage table 26b and the key creation additional questionnaire temporary table 26
c has two tables each having the same configuration. The large / medium / small category number table 26d includes large, medium and small category number tables of three stages. Create visitor preferences and requests as keys Combine multiple keys to form a new key Match keys and locks based on a key-to-lock comparison table Present visitors with search results, receive product orders from visitors / receive comments Calculation, product exchange, billing of point provision fee to members and affiliated company malls Exhibitor / store / work / product management table registration update

FIG. 5 shows the role sharing of the support server 20 provided in the studio 21 of FIG. The support server 20
The DA member 11 provides support for displaying works in the library and products in the mall. The support server 20 has a DA member authentication management table 2 for authenticating the DA member 11.
0a, homepage / store creation support content 2
8 to perform a support process 20b for the DA member 11. In the homepage / store creation support content 28,
Titles, wallpapers, characters, etc. are prepared. The support process 20b is performed by the DA member 11 by the digital input / output device 21a or the analog input / output device 21 provided in the studio 21.
b, DA member terminal 29 directly connected to the support server
a, 29b and the like. A DA staff terminal 29c operated by staff at the digital atelier 10 is also connected to the support server 20. The digital input / output device 21a includes a CD / DVD
Recorder and the like. The analog input / output device 21b includes an analog VTR and the like. DA member terminal 29
A personal computer or the like is used for the terminals a and 29b and the DA staff terminal 29c.

In the support processing 20b, the following processing is performed. Upload of homepage (works) / stores (products) Exhibitor / store / works / product management, authentication management for editing, registration / update of lock management table Registration / update of key / table comparison management table Digital conversion of analog input data, digital data Analog output conversion Studio / school usage fee, lock renewal fee request Support content registration / update Support content use Comment / order content confirmation, point provision (library) Addition / change of works / products

It is to be noted that only the following operations can be performed from the DA member terminals 29a and 29b provided in the studio 21. From the DA staff terminal 29c,
Only the operation of is allowed. In addition, DA member 11
The service provided from the support server 20 can also be received via the Internet 17.

When a product is searched on a conventional electronic mall, it is necessary to input a keyword representing the category or feature of the product, such as "sweater" or "blue". However, there are cases where the consumer using the electronic mall cannot recall the keyword well, or the keyword set by the consumer is not included in the product. Also, a search for a product that satisfies complex requirements, such as a common gift to a plurality of consumers with different preferences, cannot be performed using keywords.

In the present embodiment, in order to match the keyword between the consumer and the product, the data is converted so that the consumer's preference and the characteristics of the product can be adapted.
The one in which the preference of a specific consumer is converted into data is called a “unique key”, and the one in which the category and characteristic of a specific product are converted into data is called a “unique lock”. When performing a search, a product having a high matching rate between “key” and “lock” is output as a search result from among the product categories specified by the consumer.

The “key” includes, besides the “unique key”, an “arbitrary key” in which arbitrarily set preferences are converted into data. It is also possible to create a new “synthetic key” by combining a plurality of “keys”. For example, a combination of three "unique keys" of A, B, and C and an "arbitrary key" called "recent fashion"
, It is possible to search for products that match the tastes of three people and that are in line with recent trends.

Further, by combining the user's own "unique key" and the "arbitrary key" provided from the expert's standpoint, it is possible to make a change in shopping for products. In addition, in order to search for a gift that is pleasing to the other party, it is possible to search for a product by borrowing the "unique key" of the other party. You can even give your friends your "unique key" so they can find what you're looking for.

Furthermore, the group can issue a "unique key" to each other and search for a common favorite product.
In this way, a shopping style that has never existed becomes possible, and its true value can be exerted particularly through an information communication network. When a consumer creates a key, he or she needs to standardize necessary data, and only have to answer whether the item is favorable or unfavorable. Also, when reusing a key, it is only necessary to recognize the ID issued at the time of the first use, so it is easy to enter keys and use it on network terminals that do not have a keyboard, such as telephones and televisions. Becomes possible.

FIG. 6 shows an example of data related to the contents of the “key” in the present embodiment. FIG. 6A shows a key data structure, FIG. 6B shows an example of a synthetic key obtained by combining a plurality of unique keys, and FIG. 6C shows a portal server 1.
6 shows an example of storage data common to the key management table 26a, the key temporary storage table 26b, the use candidate key table 26k, and the combination candidate key table 26l.

The contents of the key structure shown in FIG. 6A are as follows. a Key type: 0 = unique key, 1 = arbitrary key bID (1): ID (1) for performing key use authentication, name cID (2): ID (2) for performing key use authentication , Birthday dID (3): ID (3) for authenticating the use of the key, postal code e Password: Password for authenticating the use of the key f Name of the key: Can be freely assigned by the creator g Number of points: Number of points given to the visitor h Data type A: Represents the work / product category to which the data type B belongs i Data type B: Represents the type of preference / requirement which is the selection criterion of the work / product j Allows multiplication: Whether or not multiplication of data values when combining keys is possible, 0 = impossible, 1 = possible k collation method: key and lock collation, 0 perfect match is required 1 key value ≤ lock value is regarded as coincident 2 key value ≥ lock value L Data value: Work / product preference / requirement Numeric data representing the value

When the data value can be multiplied, 0 indicates that it is not preferable, and 1 indicates that it is preferable. Data type A, data type B, multiplication permission, collation method,
The five data values form a data block representing one preference / request. In any case, ID (2), ID
(3) The password and the number of points are zero. ID
(1) represents a library mall number. 000 is a library, 001 is a mall, and 010 to 999
Indicates a partner company mall.

Here, assuming a visitor 19 to a mall A, an example of searching for a product by a combination of keys is shown. The unique key of A is included in the data structure shown in FIG.
It can be specified by ID, password, or key name.
In FIG. 6 (b), assuming that the party A, B, and C will have a party and search for small prizes equivalent to all, a synthetic key for searching for a product that is favorable for all is created. I will show you how to think. The unique key of A is shown in FIG.
The data value is set so as to indicate whether the data value is 1 or 0 corresponding to the data numbers 1 to n shown in FIG. A data value of 0 indicates that it is not preferable, and 1 indicates that it is preferable. As shown in FIG. 6B, a combination of the data type A and the data type B, a skeleton design,
Data names such as purple, red, and green correspond to 1: 1. In each of the "unique keys" of A, B, and C, it is assumed that A does not like purple, B does not like white, and C has no dislike color. Further, D is set as an arbitrary key, and since it is a summer accessory design key, purple, red, and black are
Add conditions to exclude from search. In the key synthesis, since the data value of the multiplication permission is 1, the data value is multiplied between the unique keys A, B, and C and the arbitrary key D. In FIG. 6B, a synthetic key for searching for a skeleton design or a characteristic of green is created.

In order for A to use the unique keys of B and C, if B and C already have unique keys, information about the names of the keys may be obtained. If there is no unique key for B and C, a new key can be created based on the preference contents of B and C. Even when a gift or the like is selected, the other party's unique key may be created based on the preference.

FIG. 7A shows the structure of a lock to be added to a work or a product displayed on the exhibitor homepage 24 of the library server 14 or the store homepage 25 of the mall server 15 in FIG. 7A, and FIG. 7B shows a lock management table 26f. Here is an example. The contents of the lock data structure are as follows. Each data is basically numerical data. A data block representing one characteristic is formed by three values of data type A, data type B, and data value. p Library mall number: Shows where the work / product is located 000 = Library 001 = Mall 010-999 = Partner company mall q Exhibitor / Store number: Shows the exhibitor name of the work / product r Work / Product number: Work -Represents the product name s Category number: Represents which category the work / product belongs to t Data type A: Represents the work / product category to which data type B belongs Value 0 is used for data unrelated to category u Data type B: Indicates the type of characteristic of the work / product vData value: Indicates the value of the characteristic of the work / product

In addition to the exhibitor / store number of q, the work / article number of r, and the category number of s, the work / article belonging to the work / article category specified by the data types A and B of t and u are displayed. For the type of characteristic, t
(1), u (1), v (1) ..., t (n), u (n),
Data of n values of v (n) is combined. The data value regarding the characteristics of the work / product is data representing the characteristics of the product such as the color and the pattern of the product. The data value of the product characteristic is represented by 0 or 1, 1 indicates the case having the feature, and 0 indicates the case not having the feature.

FIG. 8 shows (a), (b), (c),
(D) and (e) show examples of the contents of the store / product management table 26h, the exhibitor / work management table 26i, the library point temporary table 26j, the candidate product table 26p, and the candidate work table 26q provided in the portal server 16. Shown respectively. The library point temporary table 26j manages points for each visitor 18 to the library. The DA member 11 checks comments based on the library number, exhibitor number, and work number, and provides points for each comment.

FIG. 9 shows the structure of another table used by the portal server 16. FIG. 9A shows a key and lock comparison management table 26g. FIG. 9B shows an additional questionnaire temporary table for key creation 26c.
FIG. 9C shows a structure common to the point exchange product table 26j and the exchange candidate product table 26r. FIG. 9D shows the candidate comparison table table 26o. FIG. 9E shows the exchange product table 26s. In the key-to-lock comparison management table 26g and the key creation additional questionnaire temporary table 26c, a value of "9" in the collation method column indicates that the visitor needs to specify the collation method.

FIG. 10 shows an example of the large / medium / small category number table 26d provided in the portal server 16.
As shown in FIGS. 10A, 10B, and 10C, categories are classified into three levels, large, medium, and small. (A) is a large category number table, (b) is a medium category number table,
(C) shows an example of a small category number table. (B) is an example of the middle classification candidate value table 26m, and (c) is also an example of the small classification candidate value table 26n.

FIG. 11 shows an operation mode of a virtual shopping mall opened in the digital atelier 10 of the present embodiment.
This is shown in comparison with FIG. In the prior art shown in FIG. 43, the agency company 5 updates the merchandise information on the homepage in place of the store opening company 3, and undertakes the homepage management agency of the store opening company 3.

The digital atelier 10 of this embodiment provides support such as professorship and content provision at the school 22 until the DA member 11 corresponding to the store opening company can open the store homepage 25 for releasing product information. Do.
After the establishment of the store homepage 25, the opening company (DA member 11) updates the product information by itself, and the digital atelier 10 does not undertake an operation agency.

The work performed by the digital atelier 10 after the establishment of the store homepage 25 is a support for the product information of the store opening company to be recognized by more people and to be linked to the ordering of the product. That is, a search system based on a key and lock mechanism is combined with a point system to connect consumers with products. When the digital atelier 10 accesses the store homepage 25, it is limited to calling product information and transmitting order information, and does not access for editing as in the prior art.

FIGS. 12 to 29 show a digital atelier 10 according to the present embodiment.
8 shows a processing procedure for selecting a product by collation based on a lock having a structure as shown in FIG. 7. The matching rate between the key and the lock is calculated using an OK counter and an NG counter prepared in advance as described later. Portal server 16 in the process of processing
Uses tables and parameters other than the table shown in FIG.

The procedure is started from step s0 in FIG. In step s1, a visitor accesses the portal server 16 via the Internet 17 and inputs an ID and a password. In step s2, a visitor ID that matches the input value of the ID from the key temporary storage table 26b provided in the portal server 16 as shown in FIG.
Clear the data associated with. In the present embodiment, the key temporary storage table 26b includes two equivalent tables. Here, hereinafter, the processing is performed for the first table. Next, in step s3, the process returns to the top of the key management table 26a.

At step s4, the key management table 26a
Call more keys. All keys that have already been created are registered in the key management table 26a. In step s5, it is determined whether or not the key is the last. If not at the end of the key
In step s6, it is determined whether or not the key type is a unique key of "0". If it is determined to be a unique key, step s7
Then, the input values of the ID and the password are compared with the ID and the password associated with the key. As a result of the comparison, when it is determined that they are equal, the key is registered in the key temporary storage table 26b in step s8, and the process returns to step s4 to call the next key. If it is determined in step s6 that the key type is not "0", or if it is determined in step s7 that the input value and the key do not match the ID or the password, the next key is called in step s4.

If it is determined in step s5 that the key is the last key registered in the key management table 26a, the process proceeds to step s5.
Move to 9. In step s9, the process returns to the top of the library point temporary table 26e shown in FIG. The number of additional points as a parameter is initialized to zero. In step s10, the library point temporary table 26e
Call the ID and the number of points. In step s11, it is determined whether or not the ID is the last. If it is not the last, the ID input value and the I
Compare with D. As a result of the comparison, if it is determined that they are equal to each other, the number of points called from the library point temporary table 26e is added to the number of additional points in step s13, and the process returns to step s10 to call the next ID and point number.

If it is determined in step s11 that the ID is the last, the process proceeds to step s14 and returns to the top of the key temporary storage table 26b. In step s15, a key is called from the key temporary storage table 26b. In step s16, it is determined whether or not the key is the last. When it is determined that the key is not the last, the key temporary storage table 2 is determined in step s17.
The number of additional points is added to the number of points corresponding to the key called in 6b and registered. Next, returning to step s15,
Retrieve the next key. If it is determined in step s16 that the key is the last, the process proceeds to step s18, and it is determined whether or not the key is present in the key temporary storage table 26b. When there is no key in the key temporary storage table 26b, as shown by A2, FIG.
Move to step s20.

At step s20 in FIG. 13, a user registration start confirmation is input. When the visitor selects "return" on the input screen, the process returns from step s21 to step s1 in FIG. 12, as indicated by A1. When the user does not select “return”, the process proceeds from step s21 to step 22, and
Enter the key name. Next, in step s23, the key type is set to “0” representing a unique key, and the ID and password, the point number = 0, and the key name are registered as a new key in the key temporary storage table 26b.

Next, at step s24, a confirmation input of what the visitor sees is performed. In step s25, it is determined whether a library has been selected. If a library is selected, the ML identification value as a parameter is set to “0” in step s25. If it is determined in step s25 that the library is not selected, the ML is determined in step s27.
Set the identification value to 1. After setting the ML identification value in step s26 or s27, the category number is input in step s28. In step s29, it is determined whether or not the number is unknown. When it is determined that it is unknown, as indicated by A5, step s1 of FIG.
Move to 30. If it is determined in step s29 that the number is not unknown, it is determined in step s30 whether the visitor has selected "return". If so, the flow returns to step s24. If it is determined in step s30 that "return" has not been selected, the process proceeds to step s40.

At step s40, the data of the second table in the key temporary storage table 26b is cleared.
Hereinafter, the key temporary storage table 26b performs processing by using both the first and second tables. Step s4
At 1, the process returns to the top of the first table of the key temporary storage table 26b. In step s42, a key is called from the first table of the key temporary storage table 26b. Step s4
In 3, it is determined whether or not the key is at the end. If it is not the last, it is determined in step s44 whether the key type is “0”. If the type is determined to be a unique key of “0”, in step s45, the visitor ID and the key I
Compare with D. If it is determined that they match, the key temporary storage table 26b is determined in step s46.
Is registered in the second table. When the condition is not satisfied in step s44 or step s45, or after registration in step s46, the process returns to step s42 to call the next key. If it is determined in step s43 that the key is at the end, the process proceeds to step s47.

In step s47, a candidate comparison table table 26o is set and data is cleared. Steps
At 48, the process returns to the top of the key / lock comparison management table 26g shown in FIG. In step s49, from the key and lock comparison management table 26g, the respective data of the work / product category number to be searched, the data type A required for the key, the data type B required for the key, the multiplication permission, the matching method, and the contents of the questionnaire are retrieved. Call. In step s50, it is determined whether or not the last of the category numbers on the key and lock comparison management table 26g. If it is not the last, the input value of the category number and the key / lock comparison management table 26 in step s51.
Compare with the category number on g. As a result of the comparison, when they match, in step s52, the candidate comparison table table 26o
, The data types A and B, the multiplication permission value, the collation method, and the contents of the questionnaire are registered. When it is determined in step s51 that the category numbers do not match, or in step s5
When step 2 is completed, the process returns to step s49 and moves to the next category number. If it is determined in step s50 that the next category number on the key and lock comparison management table 26g is the last, the process proceeds to step s50 in FIG.
Move to 53.

In step s53 of FIG. 14, the process returns to the top of the second table of the key temporary storage table 26b. Next, in step s54, a key is called from the second table of the key temporary storage table 26b. In step s55, it is determined whether or not the key is the last. If it is determined that the key is not the last key, in step s56, the candidate comparison table table 26o
Return to the beginning. In step s57, the data types A and B, the multiplication permission value, the matching method, and the contents of the questionnaire are called from the candidate comparison table table 26o. Step s58
Then, it is determined whether or not the end of the candidate comparison table table 26o has been reached. When it is determined that the last key has been reached, the process returns to step s54, and the next key is called from the second table of the key temporary storage table 26b.

In step s58, the candidate comparison table 26
If it is determined that it is not the last of o, the variable n is set to n = 1 in step s59. Next, in step s60, it is determined whether or not the data type A of the key is the last. If it is not the last, the data type A and the key data type A of the candidate comparison table table 26o are determined in step s61.
(N). When it is determined that the comparison results in a match, in step s62, the data type B of the candidate comparison table 26o is compared with the key data type B (n). When it is determined that they do not match, or when it is determined that they do not match in step s61, the value of the parameter n is increased by 1 in step s63, and the process returns to step s60.

When it is determined in step s62 that there is a match
Is the key creation addition shown in FIG. 9B in step s64.
In the questionnaire temporary table 26c, the ID and the data type are stored.
A, B value, key multiplication permission value, collation method, and data value
register. The additional questionnaire temporary table for key creation
26c is provided with two tables, step s6
In 4, the second table is used. Step s60
When it is determined that the key data type A is the last,
In step s65, additional questionnaire temporary table 2 for key creation
In the first table of FIG. 6c, ID, candidate comparison table table 2
6o data types A and B values, key multiplication permission value, collation method,
And register data values. Step s64 or step
When step s65 is completed, the process moves to step s57 and the candidate
The next data is called out in the comparison table table 26o.

If it is determined in step s55 that the key is at the end, the process proceeds to step s66, where it is determined whether or not there is data in the second table of the additional key creation questionnaire temporary table 26c. If there is data, as shown by A8,
It moves to step s69 of FIG. If it is determined in step s66 that there is no data, in step s67, the data in the second table of the key temporary storage table 26b and the data in the candidate comparison table table 26o are cleared. Step s6
At 8, it is determined whether or not there is data in the first table of the additional questionnaire temporary table for key creation 26c. If it is determined in step s68 that there is no data, the process proceeds to step s180 in FIG. 19 as indicated by A10. If it is determined in step s68 that there is data, the process proceeds to step s160 in FIG. 18 as indicated by A11.

FIG. 15 shows a procedure when it is determined in step s66 of FIG. 14 that there is data in the second table of the additional questionnaire temporary table for key creation 26c. In step s69, the process returns to the top of the second table of the key temporary storage table 26b. In step s70, a key is called from the second table of the key temporary storage table 26b. In a step s71, it is determined whether or not the key is the last. If it is not the last, the process returns to the top of the second table of the additional questionnaire temporary table for key creation 26c in step s72. In step s73, the ID, the data types A and B values, the multiplication permission value, the matching method, and the data value are called from the second table of the additional questionnaire temporary table for key creation 26c. In step s74, it is determined whether or not the second table of the additional questionnaire temporary table for key creation 26c is at the end. If it is the last, return to step s70 and call the next key. If it is determined in step s74 that it is not the last, in step s75, the input value of the visitor ID is compared with the visitor ID on the second table of the additional key creation questionnaire temporary table 26c. If they do not match, the flow returns to step s70 to call the next key.

If it is determined in step s75 that the visitor IDs match, in step s76 the parameter n
Is set to n = 1, and it is determined in step s77 whether or not the key data type A (n) is the last. If it is not the last, the data type A of the second table of the additional questionnaire temporary table for key creation 26c is compared with the data type A (n) of the key in step s78. If it is determined that they match, the data type B of the second table of the additional questionnaire temporary table for key creation 26c and the data type B (n) of the key are compared in step s79. When it is determined that they do not match as a result of the comparison, or when it is determined that they do not match in step s78, step s
At 80, the value of the parameter n is increased by 1, and the process returns to step s77. When it is determined in step s77 that the data type A (n) is the last, in step s81, the ID, data type A and B values, multiplication permission value, Collation method,
And the data value are registered in the key of the second table of the key temporary storage table 26b. When it is determined in step s79 that the comparison results match, or after the registration in step s81 is completed, the next data is called in step s73.

If it is determined in step s71 that the key is the last key, in step s82, the visitor ID, the data type A and B values, the multiplication permission, The value, the collation method, the data value, and the contents of the questionnaire are called, and data in which the called visitor ID matches the input value of the visitor ID is cleared. Next, in step s83, the process returns to the top of the second table of the key temporary storage table 26b. Step s84
Then, the key is called from the second table of the key temporary storage table 26b. In step s85, the process returns to the top of the candidate comparison table table 26o.

Next, in step s86, the data types A and B, the multiplication permitted value, the collation method and the contents of the questionnaire are called from the candidate comparison table table 26o. In step s87, it is determined whether or not it is the last of the candidate comparison table table 26o. When it is determined to be the last, as shown by A9, FIG.
It returns to step s67 of 4. When it is determined in step s87 that it is not the last, the parameter n is determined in step s88.
Is set to n = 1. Next, in step s89, it is determined whether or not the key data type A (n) is the last. If it is not the last, in step s90, the data type A of the candidate comparison table table 26o is compared with the key data type A (n). If it is determined that they match, as a result of the comparison, step s9
In step 1, the data type B of the candidate comparison table 26o is compared with the key data type B (n). As a result of the comparison, when it is determined that they do not match, or when it is determined that they do not match in step s90, n is determined in step s92.
Is increased by 1 and the process returns to step s89.

At step s89, the key data type A (n)
Is the last, the process moves to step s93.
In step s93, the ID, the data types A and B values, the multiplication permission value, the matching method, the data value, and the contents of the questionnaire in the candidate comparison table table 26o are stored in the first table of the key creation additional questionnaire temporary table 26c. register. When it is determined in step s91 that they match, or when the registration in step s93 ends, step s86
To call the next data.

FIG. 16 shows a processing procedure when it is determined in step s18 of FIG. 12 that a key exists in the first table of the key temporary storage table 26b. In step s100, the process returns to the top of the first table in the temporary key storage table 26b. In step s101, the key temporary storage table 2
Retrieve the key from the first table in 6b. Step s10
In 2, it is determined whether or not the key type is “0” representing a unique key. If the key type is “0”, step s10
At 3, the visitor ID is compared with the key ID. If they do not match, or the key type is “0” in step s102
If not, the process returns to step s101,
Retrieve the next key. If it is determined in step s103 that they match, in step s104, the key point number is called. In step s105, a point exchange confirmation input for confirming with the visitor whether or not to exchange points is performed. In step s106, it is determined whether or not a point exchange confirmation input has been performed. If it is determined that the operation has not been performed, it is determined in step s107 whether “return” has been selected. When it is determined that the selection has been made, A1
Returning to step s1 in FIG. "Return"
When it is determined that is not selected, the process returns to step s24 in FIG. 13, as indicated by A12.

If it is determined in step s106 that the point exchange confirmation input has been performed, step s108
Then, the data area of the exchange candidate commodity table 26r shown in FIG. 9C is cleared. In step s109, the process returns to the top of the point exchange product table 26j. Next, in step s110, from the point exchange product table 26j,
Retrieve the product name and the required number of points. Step s111
Then, it is determined whether or not the end of the product name. If it is not the last, the number of points of the key is compared with the required number of points in step s112. When the key point number ≧ the required point number, in step s113, the required point number and the product name are registered in the exchange candidate product table 26r. After the registration is completed, or if the key point number <the required point number in step s112, the process returns to step s110 to call the next data.

When it is determined in step s111 that the product name is the last, the process returns to the top of the exchange candidate product table 26r in step s114. In the next step s115, a product is called from the exchange candidate product table 26r. Steps
At 116, an input is made for the visitor to confirm which product to exchange. In step s117, it is determined whether or not the visitor has selected "return". When it is determined that the visitor has been selected, the process returns to step s100. Step s1
If it is determined in step 17 that the visitor has not selected “return”, in step s118, the visitor receives the destination address,
Confirm and enter your name. In step s119,
The ID, the entered product name,
Register the destination address, name, etc. In step s120, the data of the exchange candidate commodity table 26r is cleared. In step s121, the required point number of the exchange product is subtracted from the key point number, and the remainder is set as a new key point number. In step s122, the process returns to the top of the first table of the temporary key storage table 26b.

In step s123, a key is called from the first key temporary storage table 26b. Steps
At 124, it is determined whether or not the key is the last. If it is not the last, “0” indicating that the key type represents the unique key in step s125
Is determined. If the key type is "0", it is determined in step s126 whether the visitor ID matches the key ID. When it is determined that they match, in step s127, the new point number obtained in step s121 is registered in the key. Steps
After completion of step 127, or when it is determined in step s125 that the key type is not “0”, or when it is determined in step s126 that the IDs do not match, step s125
Returning to 123, the next key is called. If it is determined in step s124 that the key is the last, the process returns to step s100.

FIG. 17 shows a processing procedure when it is determined in step s29 of FIG. 13 that the category number is unknown.
In step s130, the process returns to the top of the large category number table shown in FIG. In step s131, a large classification and a large category are called from the large category number table.
In step s132, it is determined whether or not it is the last of the large classification. If it is not the last, step s131
To call the next major category. If it is determined in step s132 that the last of the large classification is to be made, in step s133, the visitor performs a confirmation input of the large classification for selecting and confirming the large classification. In step s134, it is determined whether the visitor has selected “return”. When "return" is selected, as indicated by A4, step s28 in FIG.
Return to

If it is determined in step s134 that the visitor has not selected "return", step s135
Then, the data of the middle classification candidate value table 26m is cleared. In step s136, the process returns to the top of the middle category number table shown in FIG. 10B in the large / medium / small category number table 26d. In step s137, the large / medium classification and the category name are called from the medium category number table. In step s138, it is determined whether or not the called middle classification is the last. If it is not the last,
In step s139, the input value of the large classification is compared with the large classification on the table. As a result of the comparison, when it is determined that they match, in step s140, the large classification / middle classification / category name is registered in the middle classification candidate value table 26m. After the registration of step s140 is completed, or after step s140
If it is determined in 139 that the major classifications do not match, the flow returns to step s137 to call the next data.

If it is determined in step s138 that the middle classification is the last, the process returns to the top of the middle classification candidate value table 26m in step s141. In the next step s142, the major category, middle category, and category name are called from the middle category candidate value table 26m. In step s143, the visitor selects and confirms the middle category and performs confirmation input of the middle category. In step s144, it is determined whether the visitor has selected “return”. When "return" is selected, the process returns to step s130.

When it is determined in step s144 that the visitor has not selected “return”, step s145
Then, the data of the small classification candidate value table 26n is cleared. In step s146, the process returns to the top of the small category number table shown in FIG. 10C in the large / medium / small category number table 26d. In step s147, the large / medium / small classification and the category name are called from the small category number table. In step s148, it is determined whether or not the called small classification is the last. If it is not the last, in step s149, the input value of the large classification is compared with the large classification on the table. As a result of the comparison, when it is determined that they match, in step s150, the input value of the middle category is compared with the middle category on the table. As a result of the comparison, when it is determined that they match, in step s151, the large classification, the middle classification, the small classification,
Register a category name. After the registration of step s151 is completed, or step s149 or step s15
If it is determined at 0 that the major classification or the middle classification does not match, the process returns to step s147 to call the next data.

If it is determined in step s148 that the small classification is the last, the process returns to the top of the small classification candidate value table 26n in step s152. In the next step s153, the large / medium / small classification and the category name are called from the small classification candidate value table 26n. In step s154, the visitor performs a confirmation input of the small classification to select and confirm the small classification. In step s155, the input values of the major category, the middle category, and the minor category are registered as category numbers. Next, step s1
At 56, the data areas of the middle classification candidate value table 26m and the small classification candidate value table 26n are cleared. Next, as indicated by A6, the process returns to step s40 of FIG.

FIG. 18 shows a processing procedure when it is determined in step s68 of FIG. 14 that there is data in the first table of the additional questionnaire temporary table for key creation 26c.
In step s160, the process returns to the top of the first table of the key creation additional questionnaire temporary table 26c. In step s161, the additional questionnaire temporary table for key generation 2
From the first table 6c, ID, data type A, B
Retrieve value, multiplication permission value, collation method, and questionnaire contents. In step s162, it is determined whether or not the first table of the additional questionnaire temporary table for key creation 26c is at the end.

If it is not the last, the input value of the visitor ID is compared with the visitor ID on the table in step s163. If the comparison results match, in step s164, the system prompts the visitor to input a data value corresponding to the questionnaire, and inputs a data value. Next, in step s165, it is determined whether or not the collation method is “9” which needs to be specified by a visitor. If it is determined to be "9", in step s166, the visitor is prompted to input a collation method, and a collation method confirmation input is performed. When it is determined that the value is not “9”, the process proceeds to step s167. In the next step s167, the process returns to the top of the first table of the temporary key storage table 26b. If it is determined in step s163 that they do not match, the flow returns to step s161 to call the next data.

In step s168, the key in the first table of the temporary key storage table 26b is called. In step s169, it is determined whether or not the key is the last. When it is determined that it is the last, the process returns to step s161,
Calls the next data. If it is not the last,
In step s170, it is determined whether or not the key type matches “0” representing the unique key. If the key type matches "0", it is determined in step s171 whether the visitor ID matches the key ID. If it is determined that they match,
In step s172, the data types A and B values, the multiplication permission value,
Register the input data value and collation method in the key. Steps
172 or after step s170 and step s
When it is determined that they do not match with each other, the step s1
Returning to 68, the next key is called. When it is determined in step s162 that the first table of the additional questionnaire temporary table for key creation 26c is the last, in step s173,
The data associated with the visitor ID that matches the input value of the ID is cleared from the first table of the key creation additional questionnaire temporary table 26c. Next, as indicated by A10, the process moves to step s180 of FIG.

In step s180 of FIG. 19, the ML provided to identify whether to use the mall or the library
The identification value is compared with “0” indicating the use of the library.
When it is determined that they do not match, in step s181,
Prompts the visitor to enter a budget and enters the budget. In step s182, the budget input value is registered as a budget value. After the budget is registered in step s182, or when it is determined in step s181 that the ML identification value matches the value “0” indicating the use of the library, the process proceeds to step s183.

In step s183, the user is prompted to confirm whether or not a key is to be used for a visitor, and an input is made. If it is determined in step s184 that no key is used, the process proceeds to step s210 in FIG. 20, as indicated by A14. If it is determined in step s184 that the key is to be used, it is determined in step s185 whether "return" has been selected. If "return" is selected, the process returns to step s181. If it is determined in step s185 that "return" has not been selected, in step s186, the visitor is prompted to confirm whether or not to use his / her own key, and an input is made. If it is determined in step s187 that another key is to be used, the process proceeds to step s290 in FIG. 23 as indicated by A16.

If it is determined in step s187 that another key is not to be used, it is determined in step s188 whether “return” has been selected. If "return" has been selected, the process returns to step s183. If it is determined in step s188 that “return” has not been selected, the data in the use candidate key table 26k is cleared in step s189. In step s190, the key temporary storage table 2
Returning to the top of the first table in 6b. Step s191
Then, the key is called from the first table of the key temporary storage table 26b. In step s192, it is determined whether or not the key is the last. If it is not the last, it is determined in step s193 whether the key type is “0” representing a unique key. If the key type is "0", the visitor ID and the key ID are compared in step s194. If the IDs match, the key is registered in the use candidate key table 26k in step s195. After the end of step s195, or when it is determined in step s193 that the key type is not “0” or in step s194 that the IDs do not match, the process returns to step s191 to call the next key.

If it is determined in step s192 that the key is the last, the use candidate key table 26 is determined in step s196.
Return to the beginning of k. In step s197, a key is called from the use candidate key table 26k. Next, in step s198, a confirmation input for prompting which key to use for the visitor is performed. In step s199, it is determined whether or not the visitor has selected "return". If so, the process returns to step s186. If it is determined in step s199 that “return” has not been selected, the key input in step s200 is registered as a search key.

In step s201, the visitor is prompted to determine whether to delete the key, and a confirmation input is made. In step s202, it is determined whether or not the visitor has selected deletion. If it is determined that deletion is selected, it is determined in step s203 whether or not there is one candidate key. If there is one candidate key, step s198
Return to If there are a plurality of candidate keys in step s203, the input key is deleted from both the first table of the key temporary storage table 26b and the key management table 26a in step s204, and the process returns to step s190. Steps
If it is determined in 202 that deletion has not been selected,
In step s205, it is determined whether or not the visitor has selected "return". If so, the process returns to step s198. If it is determined in step s205 that "return" has not been selected, an input is made in step s206 to prompt the user to confirm whether to combine the key with the visitor. Steps
If it is determined in 207 that the key combination has been selected, the process proceeds to step s310 in FIG. 24 as indicated by A18. If it is determined in step s207 that a combination has not been selected, the data in the use candidate key table 26k is cleared in step s208, and the process proceeds to step s370 in FIG. 26 as indicated by A19.

FIG. 20 shows a processing procedure after it is confirmed in step s184 of FIG. 19 that no key is used. In step s210, it is determined whether or not the ML identification value is “0” representing a library. If the ML identification value is “0”,
As indicated by A20, the process moves to step s237 of FIG. If it is determined in step s210 that the ML identification value is not “0”, the data in the candidate product table 26p is cleared in step s211. In step s212, the process returns to the top of the store / product management table 26h shown in FIG. In step s213, a mall number, a store number, a store name, a product number, a product name, a category number, a unit price, and a product page address are called from the store / product management table 26h. In step s214, it is determined whether or not the end of the category number. If it is not the last, in step s215, the input value of the category number is compared with the category number on the table. If the comparison results match, in step s216, the budget value is compared with the unit price on the table. If budget value ≧ unit price, step s
At 217, the mall number, store number, store name, product number, product name, unit price, and product page address are registered in the candidate product table 26p. After completion of the registration in step s217, or when it is determined in step s215 that they do not match, in step s216, if the budget value is smaller than the unit price, the process returns to step s213 to call the next data.

If it is determined in step s214 that the category number is the last, the process returns to the top of the candidate commodity table 26p in step s218. In step s219, a mall number, a store number, a store name, a product number, a product name, a unit price, and a product page address are called from the candidate product table 26p. In step s220, the candidate products are sorted in the order of the store numbers. In the next step s221, a confirmation input for prompting the visitor to confirm and enter the mall number and the store number is performed. If it is determined in step s222 that the visitor has input “return”, the process returns to step s183 in FIG. 19 as indicated by A13. Step s22
If it is determined in Step 2 that “Return” has not been selected,
In step s223, a confirmation input is made to prompt the visitor to confirm and enter the product number. If "return" is selected in step s224, the process returns to step s221. If “return” has not been selected in step s224, the process proceeds to step s225.

In step s225, a confirmation input is performed by prompting the visitor to order the product input by the product number. If it is determined in step s226 that the visitor has selected to end, in step s227, the key associated with the visitor ID, the search key, the candidate product table 26p, and the budget are stored in the first key storage table 26b. Clear the value and ML type value data. Next, as indicated by A1, the process returns to step s1 of FIG. Step s2
If the visitor has not selected "end" in 26, it is determined in step s228 whether the visitor has selected to search for another product. If selected, step s
At 229, the data of the candidate product table 26p, the search key, the budget value, and the ML identification value are cleared. Next, as indicated by A12, the process returns to step s24 of FIG.

If it is determined in step s228 that the search for another product is not selected, step s230 is performed.
Then, it is determined whether or not the visitor has selected “return”. When it is determined that the selection has been made, the process returns to step s223 as indicated by A21. If it is determined in step s230 that "return" has not been selected, it is determined in step s231 whether "view" has been selected. If it is determined that the selection has been made, the step s
At 232, the mall number,
A store number, a product number, and a product page address associated with each input value are called. Next, in step s233, a confirmation input for confirming that the visitor has browsed the product is performed, and the process returns to step s225. If it is determined in step s231 that “view” has not been selected, the process proceeds to step s231.
At 234, a confirmation input for confirming the address, name, payment method, etc., is made to the visitor. Next, if “return” is selected in step s235, the process returns to step s225,
If "return" is not selected, a mall number, a store number, a store name, a product number, a product name, a unit price, a quantity, an address, a name, a payment method, and the like are registered in an order form in step s236. Next, as indicated by A22, the process moves to step s270 of FIG.

FIG. 21 is a flowchart showing the operation of M in step s210 of FIG.
The processing procedure when the L identification value is determined to be “0” is shown.
In step s237, the data of the candidate work table 26q is cleared. In step s238, the process returns to the top of the exhibitor / work management table 26i shown in FIG. In step s239, the library number, exhibitor number, exhibitor name, work number, work name, category number, and work page address are called from the exhibitor / work management table 26i. In step s240, it is determined whether or not the last of the category number. If it is not the last, the input value of the category number is compared with the category number on the table in step s241. If the comparison results match, in step s242, the candidate work table 26q
Register the library number, exhibitor number, exhibitor name, work number, work name, and work page address. After completion of the registration in step s242, or when it is determined in step s241 that they do not match, the process returns to step s239 to call the next data.

If it is determined in step s240 that the category number is the last, the process returns to the top of the candidate work table 26q in step s243. In step s244, the library number, exhibitor number,
Retrieve the exhibitor name, work number, work name, and work page address. In step s245, the candidate works are sorted in exhibitor number order. In the next step s246, a confirmation input for prompting the visitor to confirm and input the library number and the work number is performed. If it is determined in step s247 that the visitor has input “return”, the process returns to step s183 in FIG. 19 as indicated by A13. If it is determined in step s247 that "return" has not been selected, then in step s248, a confirmation input prompting the visitor to confirm and input the work number is performed. Step s2
If "return" is selected in 49, step s246
Return to If “return” has not been selected in step s249, the process proceeds to step s250.

At step s250, a confirmation input is made by prompting the visitor to leave a comment on the work.
When it is determined in step s251 that the visitor has selected to end, in step s252, the key associated with the visitor ID, the search key, the candidate work table, and the budget value are obtained from the first table of the temporary key storage table 26b. , ML identification value data is cleared. Next, as indicated by A1, the process returns to step s1 of FIG. If the visitor has not selected “end” in step s251, step s253
To determine whether the visitor has chosen to look for another work. If selected, in step s254, the data of the candidate work table, the search key, the budget value, and the ML identification value are cleared. Next, as shown by A12, FIG.
Return to step s24.

If it is determined in step s253 that search for another work has not been selected, step s255
Then, it is determined whether or not the visitor has selected “return”. If it is determined that the selection has been made, step s24
Return to 8. If it is determined in step s255 that “return” has not been selected, “view” is determined in step s256.
It is determined whether or not is selected. If it is determined that it is selected, the library page, exhibitor number, work number, and work page address associated with each input value are called from the candidate work table in step s257.
Next, in step s258, a confirmation input for confirming that the work has been browsed by the visitor is performed, and in step s25
Return to 0. If it is determined in step s256 that "view" has not been selected, in step s259, the visitor is caused to input a comment. If it is determined in step s260 that the visitor has selected “return”, step s250
Return to If it is determined in step s260 that “return” has not been selected, in step s261, the library number, exhibitor number, work number, and comment input value are entered in FIG.
It is registered in the library point temporary table 26e shown in (c). Next, in step s262, a confirmation input for confirming whether or not to search for another work is made to the visitor. Step s26
In step 3, it is confirmed whether or not “search” is selected. If it is selected, the process returns to step s254 as indicated by A23. If “search” is not selected, step s25
Return to 2.

FIG. 22 shows a procedure following the ordering of the product following step s236 in FIG. Step s27
At 0, the process returns to the top of the first table of the temporary key storage table 26b. In step s271, the key is called from the first table of the key temporary storage table 26b. Steps
At 272, it is determined whether or not the key type is “0” representing a unique key. If the key type is “0”, step s
At 273, the visitor ID is compared with the key ID. If they do not match, or if it is determined in step s272 that the key type is not “0”, the process returns to step s271 to call the next key. If it is determined in step s273 that they match, the key point number is called in step s274. In step s275, the number of merchandise order points is added to the number of key points to obtain a new key point number. In step s276, the order form is transmitted to the store, and a point provision fee is charged. Step s277
Then, the processing returns to the top of the first table of the key temporary storage table 26b.

In step s278, the key is called from the first key temporary storage table 26b. Steps
At 279, it is determined whether the key is the last or not. If it is not the last, in step s280, the key type is “0” representing a unique key.
Is determined. If the key type is “0”, it is determined in step s281 whether the visitor ID matches the key ID. When it is determined that they match, in step s282, the new point number obtained in step s275 is registered in the key. Steps
After completion of step 282, or when it is determined in step s280 that the key type is not “0” or when it is determined in step s281 that the IDs do not match, step s280
Returning to 278, the next key is called. If it is determined in step s279 that the key is the last, the process proceeds to step s283,
A confirmation input is made to the visitor to confirm whether or not to search for another product. In step s284, it is determined whether or not the visitor has selected “search”. If it is determined that the selection has been made, the process proceeds to step s285, where the candidate product table 26 is selected.
The data of p, the search key, the budget value, and the ML identification value are cleared, and the process returns to step s24 of FIG. 13 as indicated by A12. If it is determined in step s284 that “search” has not been selected, the key associated with the visitor ID, the search key, the candidate merchandise table 26p, and the budget from the first key temporary storage table 26b in step s286. The value and the data of the ML identification value are cleared, and the process returns to step s1 in FIG. 12, as indicated by A1.

FIG. 23 shows a processing procedure when it is determined in step s187 of FIG. 19 that another key is used. In step s290, a confirmation input for confirming whether to use an arbitrary key for a visitor is performed. At step s291, it is determined whether or not another person's key has been selected. When it is determined that another person's key has not been selected, it is determined at step s292 whether "return" has been selected. If it is determined that “return” has been selected, the process returns to step s186 in FIG. 19 as indicated by A15. If it is determined in step s292 that "return" has not been selected, step s29
At 3, the data in the use candidate key table 26k is cleared. In step s294, the process returns to the top of the key management table 26a. In step s295, the key management table 26
Call the key from a. In step s296, it is determined whether or not the key is the last. If it is not the last, it is determined at step s297 that the key type is "1" indicating an arbitrary key.
Is determined. If the key type is "1",
In step s298, the key is registered in the use candidate key table. After the registration in step s298 is completed, or when it is determined in step s297 that the key type is not “1”, the process returns to step s295 to call the next key.

If it is determined in step s296 that the key is at the end, the process returns to the top of the use candidate key table in step s299. In step s300, use candidate key table 2
The key is called from 6k, and it is determined in step s301 whether or not there is a candidate key. If there is no candidate key, the process returns to step s186 in FIG. 19 as indicated by A15. Step s3
01, when it is determined that there is a candidate key, step s3
At 02, a confirmation input for confirming which key to use for the visitor is made. In step s303, it is determined whether or not the visitor has selected “return”. If you select "Back",
As indicated by A16, the process returns to step s290. If it is determined in step s303 that "return" has not been selected, the input key is registered as a search key in step s304, and the process returns to step s206 in FIG. 19 as indicated by A17.

When it is determined in step s291 that another person's key is to be selected, in step s305, the user is prompted to input the owner of the key and the name of the key. Steps
At 306, the process returns to the top of the key management table 26a. In step s307, the ID is obtained from the key management table 26a.
(1) The key is called by the key owner and the key name. Next, in step s308, the call key is registered as a search key, and as indicated by A17, in step s2 of FIG.
Return to 06.

FIG. 24 shows a processing procedure when a key combination is selected in step s207 of FIG. In step s310, the data in the combination candidate key table 26l is cleared. In step s311, a confirmation input for confirming whether to use an arbitrary key for a visitor is performed. Steps
At 312, it is determined whether or not another person's key has been selected.
At 313, it is determined whether or not to select its own key. When it is determined that the user's own key is not selected, it is determined whether or not “return” has been selected in step s314. "Return"
If it is determined that is selected, the process returns to step s206 in FIG. 19 as indicated by A17. Step s31
If it is determined in step 4 that "return" has not been selected,
In step s315, the process returns to the top of the key management table 26a. In step s316, a key is called from the key management table 26a. In step s317, it is determined whether or not the key is the last. If it is not the last, it is determined in step s318 whether the key type is "1" representing an arbitrary key. If the key type is "1", the key is registered in the combination candidate key table 26l in step s319. After the registration in step s319 is completed, or when it is determined in step s318 that the key type is not “1”, the process returns to step s316 to call the next key.

If it is determined in step s317 that the key is the last, the combination candidate key table 26 is determined in step s320.
Return to the beginning of l. In step s321, a key is called from the combination candidate key table 26l, and in step s322, confirmation of which key to use for a visitor is prompted and confirmation is input.
If it is determined in step s323 that the visitor has selected “return”, as shown in A18, step s310
Return to If it is not determined in step s323 that "return" has been selected, the input key is registered as a combination key in step s324.

If it is determined in step s313 that the user selects his / her own key, the process returns to the top of the first key temporary storage table 26b in step s325. In step s326, the key is called from the first table of the key temporary storage table 26b. In step s327, it is determined whether or not the key is the last. If it is the last key, the process moves to step s320. If it is determined in step s327 that the key is not the last key, it is determined in step s328 whether the key type is “0” representing a unique key. If the key type is “0”, the visitor ID and the key ID are compared in step s329. As a result of the comparison, when it is determined that they match, in step s330, the key is registered in the combination candidate table 26l. After the registration in step s330 is completed, if it is determined in step s328 that the key type is not “0”, or if it is determined in step s329 that the IDs do not match, the process returns to step s326, and the next key is deleted. Call.

When it is determined in step s312 that another person's key is to be selected, in step s331, the visitor is prompted to input the owner of the key and the name of the key. Steps
At 332, the process returns to the top of the key management table 26a. In step s333, the ID is read from the key management table 26a.
(1) The key is called by the key owner and the key name. Next, in step s334, the call key is registered as a combination key. Step s324 or step s33
After the registration of step S4, as indicated by A25, step s in FIG.
Move on to 350.

FIG. 25 shows the processing procedure of the search using the combination key, following step s324 or s334 in FIG. In step s350, the search key is copied, the key type is set to “0” to create a synthetic unique key, and the ID, password, and number of points of the synthetic unique key are referred to the first table of the key temporary storage table 26b, Update to In step s351, the parameters m and n are set to 1 respectively. In step s352, it is determined whether the data type A of the search key is the last. If it is not the last, in step s353, the data type A (m) of the combination key and the data type A (n) of the search key are compared. If they match, in step s354, the data type B (m) of the combination key is compared with the data type B (n) of the search key. If so, in step s355, it is determined whether or not the multiplication permission value of the search key is “1”. Step s353, step s354, or step s3
If it is determined in step 55 that they do not match, step s
In step 356, the value of the parameter n is increased by 1, and the process returns to step s352.

If it is determined in step s355 that the multiplication permission value of the search key is "1", step s357
Multiplies the search key data value by the combination key data value and obtains the multiplication result as a multiplied data value. In step s358, the data values of the data types A (n) and B (n) of the synthetic key are updated with the multiplied data values. In step s359,
Clear the multiplication data value. After the process of step s359 is completed, or when it is determined in step s352 that the data type A of the search key is the last, the process proceeds to step s36.
Move to 0. In step s360, the value of the parameter m is increased by 1, and the value of the parameter n is set to n = 1. In step s361, it is determined whether or not the data type A of the combination key is the last. If it is not the last, the process returns to step s352. If it is determined that the search key is the last in step s361, the search key is updated and registered with the composite key in step s362, and in step s363, the data of the combination key and combination candidate key table 26l is cleared. In step s364, a confirmation input for confirming whether or not the visitor should be recombined is performed. If it is determined in step s365 that re-combination has been selected, the process returns to step s310 in FIG. 24 as indicated by A18. If it is determined in step s365 that recombination has not been selected, in step s366, the user is prompted to input a key name to the visitor. Step s36
If it is determined in step 7 that "return" has been selected, the process returns to step s364. If it is determined in step s367 that “return” has not been selected, step s36
In step 8, the key is registered in the first table of the key management table 26a and the key temporary storage table 26b, and the process proceeds to step s370 in FIG. 26 as indicated by A19.

FIG. 26 shows the procedure of a search process following step s368 in FIG. In step s370, the ML
It is determined whether or not the identification value is “0” representing a library. If the ML identification value is “0”, the process proceeds to step s420 in FIG. 28 as indicated by A27. Step s37
When it is determined that the ML identification value is not “0” at 0, the data of the candidate product table 26p is cleared at step s371. In step s372, the process returns to the top of the store / product management table 26h. In step s373, a mall number, a store number, a store name, a product number, a product name, a category number, a unit price, and a product page address are called from the store / product management table 26h. In step s374, it is determined whether or not the end of the category number. If it is not the last, in step s375, the input value of the category number is compared with the category number on the table.
If the comparison results match, in step s376, the budget value is compared with the unit price on the table. If budget value ≧ unit price, in step s377, the candidate product table 26p
Register the mall number, store number, store name, product number, product name, unit price, and product page address. Step s3
After completion of the registration in 77, or when it is determined in step s375 that they do not match, in step s376 the budget value <
If it is a unit price, the flow returns to step s373 to call the next data.

If it is determined in step s374 that the category number is the last, the process returns to the top of the candidate commodity table 26p in step s378. In step s379, the mall number, store number, store name, product number, product name, unit price, and product page address are called from the candidate product table 26p. In step s380, it is determined whether or not the product number is the last. When it is determined to be the last, the process proceeds to step s400 in FIG. 27 as indicated by A28. Steps
If it is determined at 380 that it is not the end of the product number,
In step s381, the lock is called using the mall number, the store number, and the product number from the lock management table 26f. In step s382, the OK counter and the NG counter are initialized to 0, and the parameters m and n are also m = 1 and n =
Set to 1.

In step s383, the lock data type A
Judge whether it is the last or not. If it is not the last, the data type A (m) of the search key and the data type A (n) of the lock are compared in step s384. As a result of the comparison, if it is determined that they match, in step s385, the data type B (m) of the search key is compared with the data type B (n) of the lock. As a result of the comparison in step s384 or s385, if it is determined that they do not match, the value of the parameter n is increased by 1 in step s386, and the process returns to step s383.

If it is determined in step s383 that the data type A of the lock is the last, the parameter m is increased by 1, the parameter n is set to n = 1, and the data type of the search key is set in step s388. It is determined whether or not A is the last. If it is not the last, step s
Return to 383. If it is determined in step s388 that the data type A of the search key is the last, then in step s389, O
The match value is obtained by dividing the count value of the K counter by the sum of the count value of the OK counter and the count value of the NG counter. In step s390, the matching rate is registered in the candidate product table 26p, and the process returns to step s379 as indicated by A25.

If it is determined in step s385 that the comparison results match, in step s391, it is determined whether the search key collation method is "2". When it is determined that the collation method is “2”, step s3
At 92, the data value of the search key is compared with the data value of the lock.
If the data value of the search key <the data value of the lock, the process returns to step s379 as indicated by A25. Step s391
If it is determined that the collation method is not "2",
In step s393, it is determined whether the collation method is “1”. If it is determined that the collation method is “1”, the data value of the search key is compared with the data value of the lock in step s394. If the data value of the search key> the data value of the lock, the process returns to step s379, as indicated by A25. If it is determined in step s393 that the collation method is not “1”, the data value of the search key and the data value of the lock are compared in step s395. If the comparison results match, the count value of the OK counter is increased by 1 in step s396. When it is determined in step s392 that the search key data value ≧ the data value of the lock, or when it is determined in step s394 that the data value of the search key ≦ the data value of the lock, the count value of the OK counter is set to 1 in step s396. Just increase. If it is determined that the comparison results in step s395 do not match, N is determined in step s397.
The count value of the G counter is increased by one. Step s3
After the end of step 96 or step s397, the process returns to step s387 as indicated by A29.

FIG. 27 shows a processing procedure for presenting a product to a visitor after it is determined in step s380 in FIG. 26 that the product number is the last. In step s400, the candidate products are sorted in the order of the matching rate. In the next step s401, a confirmation input is made to prompt the visitor to confirm and enter the product number. In step s402, a confirmation input is performed by prompting the visitor to order the product input by the product number. If it is determined in step s403 that the visitor has selected termination, in step s404, the key temporary storage table 2
6b, the key associated with the visitor ID, the search key, the candidate product table 26p, the budget value, the ML
Clear the identification value data. Next, as indicated by A1, the process returns to step s1 of FIG. If the visitor has not selected "end" in step s403, step s403
At 405, it is determined whether the visitor has selected to search for another product. If selected, step s406
, The candidate product table 26p, the search key, the budget value, and M
Clear the data of the L identification value. Next, as indicated by A12, the process returns to step s24 of FIG.

If it is determined in step s405 that search for another product is not selected, step s407 is performed.
Then, it is determined whether or not the visitor has selected “return”. If it is determined that the selection has been made, step s40
Return to 1. If it is determined in step s407 that “return” has not been selected, “view” is determined in step s408.
It is determined whether or not is selected. When it is determined that the item is selected, in step s409, a mall page number, a store number, and a product page address associated with the product number are called from the candidate product table 26p. Next, in step s410, a confirmation input for confirming that the visitor has browsed the product is performed, and in step s402.
Return to If it is determined in step s408 that “view” has not been selected, in step s411, a confirmation input for confirming the address, name, payment method, and the like is performed on the visitor. Next, if “return” is selected in step s412, the process returns to step s402, and if “return” is not selected, in step s413, the mall number, store number, store name, product number, product Register the name, unit price, quantity, address, name, payment method, etc. Next, A22
Then, the process proceeds to step s270 in FIG.

FIG. 28 is a flowchart showing the operation of M in step s370 of FIG.
The procedure of the search process when it is determined that the L identification value is “0” is shown. In step s420, the candidate work table 2
Clear 6q data. In step s421, the process returns to the top of the exhibitor / work management table 26i. In step s422, from the exhibitor / work management table 26i,
Retrieve library number, exhibitor number, exhibitor name, work number, work name, category number, and work page address. In step s423, it is determined whether or not the end of the category number. If it is not the last, in step s424, the input value of the category number is compared with the category number on the table. If the comparison results match, in step s425, the library number, exhibitor number, exhibitor name, work number, work name, and work page address are registered in the candidate work table 26q. Step s425
After the end of the registration in step S424, or when it is determined in step s424 that they do not match, the flow returns to step s422 to call the next data.

If it is determined in step s423 that the category number is the last, the process returns to the top of the candidate work table 26q in step s426. In step s427, the library number, exhibitor number,
Retrieve the exhibitor name, work number, work name, and work page address. In step s428, it is determined whether or not the work number is the last. If it is determined to be the last, the process proceeds to step s450 in FIG. 29 as indicated by A30. If it is determined in step s428 that it is not the last of the product number, in step s429, the library number, exhibitor number, and work number are obtained from the lock management table 26f using:
Call the lock. In step s430, the OK counter and N
G counter is initialized to 0, and parameters m and n are also m =
1, n = 1.

In step s431, the lock data type A
Judge whether it is the last or not. If it is not the last, the data type A (m) of the search key and the data type A (n) of the lock are compared in step s432. As a result of the comparison, if it is determined that they match, in step s433, the data type B (m) of the search key is compared with the data type B (n) of the lock. As a result of the comparison in step s432 or s433, if it is determined that they do not match, the value of the parameter n is increased by 1 in step s434, and the process returns to step s431.

If it is determined in step s431 that the data type A of the lock is the last, the parameter m is increased by 1, the parameter n is set to n = 1, and the data type of the search key is set in step s436. It is determined whether or not A is the last. If it is not the last, step s
Return to 431. When it is determined in step s436 that the data type A of the search key is the last, in step s437,
The match value is obtained by dividing the count value of the K counter by the sum of the count value of the OK counter and the count value of the NG counter. In step s438, the matching rate is registered in the candidate work table 26q, and the process returns to step s427.

If it is determined in step s433 that the comparison results match, in step s439, it is determined whether the search key collation method is “2”. If it is determined that the collation method is “2”, step s4
At 40, the data value of the search key is compared with the data value of the lock.
If the data value of the search key <the data value of the lock, step s
Return to 427. If it is determined in step s439 that the matching method is not “2”, it is determined in step s441 whether the matching method is “1”. If it is determined that the collation method is "1", the process proceeds to step s4.
At 42, the data value of the search key is compared with the data value of the lock.
If the data value of the retrieval key> the data value of the lock, step s
Return to 427. When it is determined in step s441 that the matching method is not “1”, in step s443,
The data value of the search key is compared with the data value of the lock. If the comparison results match, the count value of the OK counter is increased by 1 in step s445. When it is determined in step s440 that the data value of the search key ≧ the data value of the lock, or when it is determined in step s442 that the data value of the search key ≦ the data value of the lock, the count value of the OK counter is set to 1 in step s445. Just increase. If it is determined that the comparison result in step s443 does not match, the process proceeds to step s443.
At 446, the count value of the NG counter is increased by one. After step s445 or s446, A
As shown at 31, the process returns to step s435.

FIG. 29 shows a processing procedure for showing a work to a visitor after it is determined in step s428 of FIG. 28 that the work number is the last. In step s450, the candidate works are sorted in the order of the matching rate. In the next step s451, a confirmation input for prompting the visitor to confirm and input the work number is performed. In step s452, confirmation input is performed by prompting the visitor to leave a comment on the work input by the work number. If it is determined in step s453 that the visitor has selected to end, in step s454, the key associated with the visitor ID, the search key, the candidate work table 26q,
Clear the budget value and ML identification value data. Next, A1
Returning to step s1 in FIG. If the visitor has not selected “end” in step s453,
In step s455, it is determined whether or not the visitor has selected to search for another work. If selected, in step s456, the candidate work table 26q, the search key, the budget value, and the data of the ML identification value are cleared. Next, A
As shown by 12, the process returns to step s24 of FIG.

If it is determined in step s455 that search for another product is not selected, step s457 is performed.
Then, it is determined whether or not the visitor has selected “return”. If it is determined that a selection has been made, step s45
Return to 1. If it is determined in step s457 that “return” has not been selected, “view” is determined in step s458.
It is determined whether or not is selected. If it is determined that it is selected, in step s459, a library page number, an exhibitor number, and a work page address associated with the work number are called from the candidate work table. Next, in step s460, a confirmation input for confirming that the work has been browsed by the visitor is performed, and step s452 is performed.
Return to If it is determined in step s458 that “view” has not been selected, in step s461, the visitor is prompted to input and a comment is input. Next, step s462
If "return" is selected in step s452, the process returns to step s452. If "return" is not selected, step s46 is performed.
At 3, the library number, exhibitor number, work number, and comment input value are registered in the library point temporary table 26e. In step s464, a confirmation input is performed to confirm whether or not the visitor should search for another work. If it is determined in step s465 that “search” has been selected, the process proceeds to step s456 as indicated by A33. If it is determined in step s465 that “search” has not been selected, the process proceeds to step s454 as indicated by A32.

FIG. 30 shows an initial screen prepared on the portal server 16 side when a visitor 18 to a library or a visitor 19 to a mall accesses the portal server 16. The purpose of the visitor accessing the portal server 16 is to view works in the library and select merchandise to be purchased at the mall. Naturally, registering preferences to make keys is out of purpose. In spite of motivation that user registration is required to accumulate prize points, it takes time to input many items in a questionnaire method. Visitors can use the library and the mall for free, and even if they can expect to receive prizes based on prize points, they will pay fees to the provider to connect to the Internet 17 and fees for using communication lines, etc. Communication costs depend on the usage time. If it takes a long time to register a preference for creating a key, communication costs will be wasted and avoided.

[0149] Therefore, by registering only the minimum preference related to a specific work or product category, the first key of the visitor is formed. First,
When a work or a product category is designated, a table of preference items required for the search is called. It is checked whether a value corresponding to the item of the table exists on the key. If the value does not exist, the value is extracted in a questionnaire format and newly registered on the key. For example, assuming that you buy a men's walking shoe, you can limit the items you need to your gender, size, materials such as cowhide or synthetic leather, and dislikes of colors. When the visitor next searches for a product in a category different from the previous time, the value of an item corresponding to the product may be registered to enhance the key. With this mechanism, it is possible to enrich the key as the lock evolves. For example, in the case of the above-mentioned men's walking shoes, if it is necessary to newly enter information on the shape such as loafers type and knitting as key data, there is naturally no corresponding data in the key, so that data is added to the additional questionnaire. The key can be updated by pulling it out. A feature of the digital atelier 10 is that a mechanism for linking a product / work and a consumer can be independently led and updated from a lock and a key.

In the case of a visitor whose taste is already registered, when searching for the same work / product category as the previous time, it is only necessary to select a key to be used. However, as mentioned above, even if you search for the same category, if the number of lock data items
You have to create a corresponding key, so you need to complete an additional survey. Also, when searching for a category different from the previous time, it is necessary to answer the questionnaire item corresponding to the category because the corresponding key value is not registered.

For example, assume a case where a visitor specifies a product category, determines a budget, and searches. in this case,
When the product category is specified, the table in which the items necessary for matching the lock and the key are registered is called, and it is checked whether the value for the data item specified by the table exists on the key. . If not, an additional questionnaire is performed and the value is newly registered in the key. Next, when a budget is designated, whether the product is within the budget or not is referred to at the time of search at the price data of the lock. If the price exceeds the budget, it is excluded from the search result candidates at that time, so that even if the lock and key match in other items, they are unconditionally excluded from the candidates. There is no budget specification when searching for works in the library.

Designation of a work, a product category, and a budget are required input items. This is because there is a concern that without these designations, the search results will be too large.
However, it is also conceivable to do wind shopping, where you can just look at the works and products one after another. In these cases, screening may be performed using only the product category and the budget without using a key.

In addition to the budget as described above, the following three methods are conceivable for collation under numerical conditions such as length and size in cm units and weight in kg units. The value of the lock should match the key and the value. (Size of clothes and shoes, etc.) The value of the lock should be equal to or smaller than the value of the key. (Budget, etc.) It is desirable that the value of the lock is equal to or greater than the value of the key. Which collation method to use is also determined by the visitor's idea, so if there is a numerical condition in the questionnaire when creating a key, it should be drawn out which collation method to choose if there is a numerical condition. Register with. The display order of the search results is displayed in descending order of the matching rate between the lock and the key.

One unique key is created when the user is registered and the questionnaire is answered, but the visitor subsequently synthesizes the keys to create new unique keys one after another.
It is assumed that it will be registered. Deletion of these unique keys is also free. Here, the registration of the prize points is performed equally for all of the created unique keys. In this way, the prize points can be prevented from disappearing due to the deletion of the unique key. Specifically, when a new unique key is registered, the premium point number of the already registered unique key is referred to, and the premium point number is also copied to the new unique key. When the premium points increase or decrease, all the registered unique keys of the visitor are called, and a new premium point is registered at the same time.

According to the present invention, a key and lock matching system is applied to the search for the library and the mall, and it is possible to quickly search for works and products that match the tastes of visitors. In addition, prize points are given to visitors to the library and the mall to motivate them to increase access. As a reward for such an increase in access, the DA member 11 is charged a fee corresponding to the number of presentations to the prize point visitor to the DA member 11 in a success reward type.

[0156]

FIG. 30 shows a visitor 18 to the library of FIG.
7 shows an initial screen displayed on a terminal device when a visitor 19 to a mall or a mall accesses the cyberspace 12 of the digital atelier 10. In the initial screen, “Name”, “Birthday”, “#Number” and “Password”
An input request is made for the four items. Of the four items,
An underlined cursor or the like is displayed on the item to be actually selected or input at that time to prompt the user to select or input. When the selection or input is performed, the display position such as the underline moves to the next item. When only a return key is input in response to an input request, the item is processed as no input. If the unique key cannot be called out from the input results of the four items, the process moves to the "first time" sheet shown in FIG.
If the visitor's unique key can be called, the process moves to the “registered” sheet shown in FIG.

FIG. 31 shows a procedure for registering preferences using the “first time” sheet. In (1), the fact that there is no user registration is displayed, and the user is prompted to confirm that registration is to be performed. "Return"
Select to return to the initial screen. If "Return" is selected in another screen, the screen returns to the previous screen. If "Confirm" is selected, the process proceeds to (2). In (2), a name is given to the key. Next, proceed to (3), and select “library” and “mall”. When "library" is selected, the budget screen in (5) is not displayed. However,
Other screens are displayed similarly. When either "mall" or "library" is selected, the process proceeds to (4) and a category number is input. When the category number is input, the key and lock comparison management table 26g is called from the category number. When "I do not know the number" is selected, the "category number" sheet is referred to, and the category number can be input in accordance with a screen as shown in FIG.

When the category number is entered in (4),
When "mall" is selected in (3), the process proceeds to (5) and a budget is input. When "library" is selected in (3), the process proceeds to (6). In (6), "use key" or "do not use" is selected. When the user selects “do not use” the key, the screen changes to a screen as shown in FIG. When "use key" is selected, the process proceeds to (7), and a key to be used is selected. When using “another key”, the screen is changed to a screen as shown in FIG. When "own key" is selected, the process proceeds to (8), and the names of registered keys are displayed. A plurality of key names may be registered. When the return key is input in a state where the displayed name is underlined, the key name is confirmed, and the process proceeds to (9) to select a process for the displayed key. In the case of "deleting a key", after deleting the selected key, the display returns to the previous screen. When "use key" is selected, the process proceeds to (10), where the key usage is selected. When combining with another key, the screen shifts to a “key combination” sheet screen as shown in FIG. When "use as it is" is selected, the screen shifts to a "search screen" sheet screen as shown in FIG.

FIG. 32 shows an input procedure on the “registered” sheet when the user has been registered. In (1), the current number of prize points is displayed, and if "point redemption" is selected, the "exchange" sheet shown in FIG. 34 is referred to.
If you select "to library mall", (2)-
(9) is the same as (3) to (10) in FIG.

FIG. 33 shows an input procedure on the “questionnaire” sheet for key formation, assuming that the category number indicates shoes as a product. In (1), the size of the shoe is input as a numerical value. In the case of such a numerical value input, the input numerical value is registered as it is. In (2), the collation method is confirmed. In (3), “like” and “dislike” for the knitting type are selected. The selection result is input as an absolute value, and 1 is registered when the knitting type is “like”, and 0 is registered when the knitting type is “dislike”.

FIG. 34 shows an input procedure on the "point redemption" sheet displayed when "point redemption" is selected in (1) of FIG. (1) shows the screen of (1) in FIG. In (2), a list of the product number and the number of prize points is displayed as prizes that can be exchanged. A plurality of products may be displayed. When you select a product,
In (3), input of a destination address and an address such as a name is required. Next, in (4), the remaining prize points are displayed. When many prize points are accumulated, "prize exchange" can be selected a plurality of times to exchange prizes.

FIG. 35 shows an input procedure when the category number is not known. (1) corresponds to (4) in FIG.
(3) of FIG. When "I do not know the number" is selected, a survey for entering the category number is performed according to the category number wizard. In (2), (3), and (4), the category of the product is narrowed down sequentially. Finally, the corresponding category number is input, and the process proceeds to (5) in FIG. 31 or (4) in FIG.

FIG. 36 shows the input procedure in the case where the key is not used, which is continued when (do not use) the key is selected in (6) of FIG. 31 or (5) of FIG. If the non-use of key is selected in (1), an exhibitor in a mall store or library is directly selected in (2). In (3), the product of the selected store or the work of the selected exhibitor is directly selected. Next, for the mall, go to the “order” sheet shown in FIG.
For the library, the process moves to a “comment” sheet shown in FIG.

FIG. 37 shows an input procedure on the “order” sheet for the visitor 19 to the mall. In (1),
"See", "Order", "Find Another Product", or "End" can be selected. When “view” is selected, the “view” sheet shown in FIG. 39 is referred to.
When "Order" is selected, the recommended products searched in (2) are displayed, and a predetermined form such as name, address, telephone number, payment method, contact method, etc. is filled in as a predetermined act. An order is placed. The order form is
It is sent to the store, and at the same time a referral commission is charged.
In (3), thank you for the purchase is displayed, and in (4), the number of prize points is displayed, and it is selected whether to end or search for another product. When searching for another product, the process proceeds to (2) on the “registered” sheet shown in FIG. To end, return to the initial screen.

FIG. 38 shows the input procedure on the "comment" sheet. In (1), "see", "leave a comment", "search for another work", or "end" can be selected. Generally, "view" is selected first, and "leave a comment" is selected later. When “view” is selected, the “view” sheet shown in FIG. 39 is referred to. When "Leave a comment" is selected, a comment is input in (2). After leaving a comment, exhibitors in the library see the comment, and the reward points are registered as thanks.
The addition of points to the unique key is performed the next time the visitor accesses the digital atelier 10. After inputting the comment, in (3), a thank-you message for browsing is displayed, and a selection is made between "end" and "search for another work".
In the case of "searching for another work", the process proceeds to (2) on the "registered" sheet shown in FIG. When "ending", the screen returns to the initial screen.

FIG. 39 shows an input procedure for selecting "view" in FIG. 37 or (1) of FIG. 38 to view a product or a work. (1) is the same as (1) in FIG. 37 and FIG.
In (2), the searched recommended product or recommended work is displayed. If you select "Confirm" in (2),
Return to (1).

FIG. 40 shows an input procedure for selecting "another key" in (7) of FIG. 31 or (6) of FIG.
(1) is the same as (7) in FIG. 31 and (6) in FIG. In (2), a key to be selected is selected. The “arbitrary key” is provided as a general search key on the digital atelier side in consideration of age, generation, or recent trends. "Other person's key" is used for gifts and other parties. If "arbitrary key" is selected, the type can be selected in (3). If you select "Other person's key" in (2), you need to enter the owner's name and key name in (3).
You need to be told in advance. In (4), the user selects “use as is” or “combine with another key”.
In the case of “combining with another key”, the “key combination” sheet shown in FIG. 41 is referred to. In case of “use as is”, refer to FIG.
Move to the "Search screen" sheet shown in FIG.

FIG. 41 shows an input procedure on the “key combination” sheet. In (1), the type of key to be combined is selected.
In (2), each of the selected key types is further selected. If you select "arbitrary key" in (1),
Select further from "arbitrary keys" prepared in (2). If "Other person's key" is selected in (1), enter the name of the key owner and the key name in (2). . When "my key" is selected in (1), my key registered in (2) is selected. In (3), whether or not to perform a key combination is further selected. When selecting “combining”, the procedure returns to (1). If "no combination" is selected, a name is given to the key in (4), and the screen shifts to a "search screen" sheet shown in FIG.

FIG. 42 shows the display on the "search screen" sheet. (1) shows a state during a search, and (2) shows a search result. As for “mall”, recommended products are displayed, and the process proceeds to an “order” sheet shown in FIG. For "Library", recommended works are displayed, and the screen moves to a "Comment" sheet shown in FIG.

[0170]

As described above, according to the present invention, transmission of information by exhibiting information in a digital atelier is supported for transmission applicants who wish to transmit information through an information communication network such as the Internet, and the prize points can be reduced. It can be used to increase the appeal of receiving information from the digital atelier by those wishing to receive it. Fees are charged to those who wish to receive the prize points to those who want to receive the prize points, and if the applicants pay the fees according to the performance of receiving the exhibition information in the digital atelier, the information communication network and Even if you do not have detailed knowledge of computers, you can publish information that will receive a lot of access. By effectively supporting such callers, you can get a fee based on your access experience, and the more you make your digital studio more attractive to those who want to receive it, the more rewards you will receive. .

Further, according to the present invention, a person who wants to transmit his / her own work can effectively release his / her work on the information communication network with support even if he / she has little knowledge of the information communication network and the computer. . When a predetermined action such as a comment on the published work is performed, a prize point is presented to the person desiring to receive, and a prize according to the number of prize points is given. Those who want to send information are charged a fee according to the number of prize points presented to those who want to receive the information. Therefore, if you create and publish exhibition information in your digital atelier, you can get more rewards as you receive more exhibition information. We can expect creation of exhibition information that we receive.

Further, according to the present invention, a person who wants to transmit information for selling a product on an information communication network such as the Internet can present information to a digital atelier with support. When the information displayed in the digital atelier is received and the product is purchased, a premium point is given to the prospective purchaser, and a fee corresponding to the premium point is given to a person who wants to transmit information related to the product. Is charged. A fee corresponding to the sale of the product can be obtained as a reward.

Further, according to the present invention, it is possible to acquire information about a preference from which information is to be retrieved from a reception applicant in the form of a question and to register the preference.

Further, according to the present invention, a search key is created by including a general element including age, generation, recent trend, etc. in the preference registered by the recipient, and information is created. Since the search is performed, the range of the information to be searched can be narrowed, and appropriate information can be provided to a person who wants to receive the information.

Further, according to the present invention, it is possible to provide, to a person who wants to transmit information, hardware and software necessary for creating exhibition information for a fee, thereby creating information to be exhibited in a digital atelier. A person who wants to transmit information can create and transmit preferable exhibition information using the provided hardware and software.

Further, according to the present invention, a person who wants to receive exhibition information from the digital atelier can measure registration of his / her preference by using the identification information. As long as the search based on the preference is performed, there is no need to register again, and the time and procedure from accessing the digital studio to obtaining the information can be reduced.

Further, according to the present invention, a digital atelier is set up, registration of a preference for a person desiring reception from the information communication network is performed, a search based on the registered preference is performed, and a prize point is provided for the person desiring reception. It is possible to automatically cause a computer to perform a process related to the provision of a prize and a process of charging a fee to a transmission applicant according to the number of prize points.

Further, according to the present invention, a person who wants to transmit information can have the information publishing means create information to be exhibited in a digital atelier even if he or she does not have much knowledge of computers and information communication networks. Becomes possible. A search key for searching for exhibition information is formed based on a preference serving as a basis for information search for a person who wants to receive exhibition information that accesses the digital atelier of the information disclosure means from the information communication network. The information publishing means causes the recipient to receive the exhibition information to which the search lock matching the formed search key is added. Since the reception applicant can receive the exhibition information that matches the registered preference, it becomes possible to receive the desired exhibition information in a short time and effort. From the information disclosure means, prize points are awarded on condition that a predetermined action is performed on the received exhibition information, and a fee corresponding to the number of prize points presented to the recipient is charged to the applicant of the exhibition information Therefore, it is possible to receive a lot of accesses, and to obtain a reward for a result of performing a predetermined action on the transmitted exhibition information. Providing the rewards can make the digital atelier more effective in supporting those who want to send.

Further, according to the present invention, in the digital atelier of the information disclosure means, the work of the transmission applicant who can receive free of charge and the product purchased for a fee are disclosed, and the reception applicant leaves a comment on the work. Or, if you purchase a product, you will receive a prize point. The presentation of the prize points motivates the recipient to receive the exhibition information, and can assist the recipient to access the information to be transmitted more.

Furthermore, according to the present invention, the exhibition server publishes, to the digital atelier, exhibition information to which the search lock added by the search lock adding means of the portal server is added for the sake of convenience at the time of search. Those who want to send information have little knowledge of computers and information and communication networks,
The exhibition server allows the exhibition information to be made public in the digital atelier. For a person who wants to receive the exhibition information accessing the digital atelier from the information communication network, the portal server generates a search key for searching the exhibition information based on the preference. Since the display information to which the search lock matching the generated search key is added is searched, it is possible for the recipient to promptly receive the desired display information. A prize point is presented to a person who wants to receive the exhibition information, on condition that a predetermined action is performed. Recipients can obtain prizes according to the number of obtained prize points, which is a powerful motivation to receive exhibition information from the digital studio. Since the portal server charges the fee corresponding to the number of prize points presented to the recipient, the applicant is requested to send the exhibition information. It can be effective to support those who wish to disclose and display information in a digital atelier.

Further, according to the present invention, since the support server supports the creation of the exhibition information to be exhibited on the exhibition server and also generates a search lock, the caller can easily search on the information communication network. Information can be transmitted as possible.

According to the present invention, works to be released free of charge can be released on the library server, and products to be sold for a fee can be released on the mall server, so that an appropriate state is set according to the nature of the exhibition information. So that it can be published.

[Brief description of the drawings]

FIG. 1 is a block diagram showing an outline of information transmission support as one embodiment of the present invention.

FIG. 2 is a block diagram showing role sharing of a library server 14 in FIG.

FIG. 3 is a block diagram showing role sharing of the mall server 15 of FIG.

FIG. 4 is a block diagram showing role sharing of a portal server 16 of FIG.

FIG. 5 is a support server 2 provided in the studio 21 of FIG.
It is a block diagram which shows the role assignment of 0.

FIG. 6 is a diagram showing a structure of a “key” in the embodiment of FIG. 1, a chart showing an example of key data, and a portal server 16;
7 is a table showing a structure common to a key management table 26a, a key temporary storage table 26b, a use candidate key table 26k, and a combination candidate key table 26l provided in the table.

FIG. 7 is a diagram showing a structure of a “lock” in the embodiment of FIG. 1 and a chart showing a structure of a lock management table 26f.

FIG. 8 shows a store / store provided in the portal server 16 of FIG.
Product management table 26h, exhibitor / work management table 2
6i is a chart showing the structure of a library point temporary table 26e, a candidate product table 26p, and a candidate work table 26q.

FIG. 9 shows a key / lock comparison management table 26g, a key creation additional questionnaire temporary table 26c, a point exchange product table 26j provided in the portal server 16 of FIG.
Exchange candidate product table 26r, candidate comparison table table 26
6 is a chart showing the structure of the exchange product table 26s.

FIG. 10 is a diagram illustrating a large server provided in the portal server 16 of FIG.
It is a table | surface which shows the example of 26 d of small / medium category number tables, 26 m of middle classification candidate value tables, and 26 n of small classification candidate value tables.

11 is a diagram showing an operation mode of a virtual shopping mall opened in the digital atelier 10 in the embodiment of FIG. 1 in comparison with FIG. 43.

12 is a digital atelier 10 of the embodiment of FIG.
It is a flowchart which shows the processing procedure with respect to visitor access.

FIG. 13 shows a digital atelier 10 of the embodiment of FIG.
It is a flowchart which shows the processing procedure with respect to visitor access.

FIG. 14 is a digital atelier 10 of the embodiment of FIG.
It is a flowchart which shows the processing procedure with respect to visitor access.

FIG. 15 shows a digital atelier 10 of the embodiment of FIG.
It is a flowchart which shows the processing procedure with respect to visitor access.

FIG. 16 shows a digital atelier 10 of the embodiment of FIG.
It is a flowchart which shows the processing procedure with respect to visitor access.

FIG. 17 shows a digital atelier 10 of the embodiment of FIG.
It is a flowchart which shows the processing procedure with respect to visitor access.

FIG. 18 shows a digital atelier 10 of the embodiment of FIG.
It is a flowchart which shows the processing procedure with respect to visitor access.

FIG. 19 shows a digital atelier 10 of the embodiment of FIG.
It is a flowchart which shows the processing procedure with respect to visitor access.

20 is a digital atelier 10 of the embodiment of FIG.
It is a flowchart which shows the processing procedure with respect to visitor access.

FIG. 21 shows the digital atelier 10 of the embodiment of FIG.
It is a flowchart which shows the processing procedure with respect to visitor access.

FIG. 22 shows a digital atelier 10 of the embodiment of FIG.
It is a flowchart which shows the processing procedure with respect to visitor access.

FIG. 23 shows a digital atelier 10 of the embodiment of FIG.
It is a flowchart which shows the processing procedure with respect to visitor access.

FIG. 24 shows a digital atelier 10 of the embodiment of FIG.
It is a flowchart which shows the processing procedure with respect to visitor access.

FIG. 25 shows the digital atelier 10 of the embodiment of FIG.
It is a flowchart which shows the processing procedure with respect to visitor access.

FIG. 26 shows a digital atelier 10 of the embodiment of FIG.
It is a flowchart which shows the processing procedure with respect to visitor access.

FIG. 27 shows the digital atelier 10 of the embodiment of FIG.
It is a flowchart which shows the processing procedure with respect to visitor access.

FIG. 28 is a digital atelier 10 of the embodiment of FIG.
It is a flowchart which shows the processing procedure with respect to visitor access.

FIG. 29 shows the digital atelier 10 of the embodiment of FIG.
It is a flowchart which shows the processing procedure with respect to visitor access.

FIG. 30 is a diagram showing an initial screen when the digital atelier 10 of FIG. 1 is accessed.

FIG. 31 is a diagram showing an input screen for registering a key when the digital atelier 10 shown in FIG. 1 is accessed for the first time.

FIG. 32 is a view showing an input screen when a visitor whose key is registered accesses the digital atelier 10 of FIG. 1;

FIG. 33 is a view showing a questionnaire input screen for forming a key in the digital atelier 10 of FIG. 1;

34 is a diagram showing a point exchange input screen in the digital atelier 10 in FIG. 1. FIG.

FIG. 35 is a diagram showing a category number input screen when accessing the digital atelier 10 of FIG. 1;

FIG. 36 is a view showing a key non-use input screen when accessing the digital atelier 10 of FIG. 1;

FIG. 37 is a diagram showing a product order screen when accessing the digital atelier 10 of FIG. 1;

38 is a diagram showing a comment input screen when accessing the digital atelier 10 in FIG. 1. FIG.

FIG. 39 is a diagram showing a screen for viewing a product or work when accessing the digital atelier 10 of FIG. 1;

FIG. 40 is a diagram showing another key input screen for accessing the digital atelier of FIG. 1;

FIG. 41 is a diagram showing a key combination input screen when accessing the digital atelier 10 of FIG. 1;

FIG. 42 is a diagram showing a screen when searching for a product or a work in the digital atelier 10 in FIG. 1;

FIG. 43 is a block diagram showing the concept of acting for a virtual shopping mall on behalf of the prior art.

[Explanation of symbols]

 10 Digital Atelier 11 DA Member 12 Cyber Space 13 Real Space 14 Library Server 14a Exhibitor HP / Work Editing Authentication Management Table 14b Processing 15 Mall Server 15a Store / Product Editing Authentication Management Table 15b Processing 16 Portal Server 16a DA Member Authentication Management table 16b Processing 17 Internet 18 Visitor to library 19 Visitor to mall 20 Support server 20a Authentication management table for DA member 20b Support processing 21 Studio 21a Digital input / output device 21b Analog input / output device 22 School 23 Partner mall 24 Exhibitor homepage 25 Store home page 26a Key management table 26b Temporary key storage table 26c Temporary table for additional questionnaire for key creation 26d Large / medium / small category No. table 26e Library point temporary table 26f Lock management table 26g Key / lock comparison management table 26h Store / product management table 26i Exhibitor / work management table 26j Point exchange product table 26k Candidate key table 26l Combination candidate key table 26m Medium classification Candidate value table 26n Small classification candidate value table 26o Candidate comparison table table 26p Candidate product table 26q Candidate work table 26r Exchange candidate product table 26s Exchange product table 28 Homepage / store creation support contents 29a, 29b DA member terminal 29c DA staff terminal

──────────────────────────────────────────────────続 き Continued on the front page (51) Int.Cl. ⁷ Identification symbol FI Theme coat ゛ (Reference) G06F 17/60 332 G06F 17/60 332 504 504

Claims (13)

[Claims] Claims: 1. A request is received from a transmission applicant who wishes to transmit information on an information communication network, a search lock is attached to the information for convenience at the time of search, and exhibition information is created for a fee. Exhibit and display in the digital atelier as a site accessible from the telecommunications network, and ask those who want to receive the exhibition information to access the digital atelier from the information and telecommunications network to register their preferences as the basis for information search , Based on the registered preferences, to generate a search key to search for exhibition information using a search lock, and to those who wish to access the digital atelier,
Upon receiving the exhibition information to which the search lock matching the generated search key is added, on condition that a predetermined action is performed on the received exhibition information, a prize point will be presented. Prizes can be obtained according to the number of obtained prize points, and a fee corresponding to the number of prize points presented to the recipient is
An information transmission support method, wherein a request is made to a person who wants to transmit the exhibition information on which the act was performed. 2. The exhibition information is a work of the transmission applicant that the reception applicant can receive free of charge, and as the predetermined action, the reception applicant leaves a comment on the received work. The information transmission support method according to claim 1, wherein 3. The display information relates to a product purchased by the person who wants to pay for a fee, and the predetermined action is that the person who wants to receive purchases the product based on the received information. The information transmission support method according to claim 1 or 2, wherein: 4. The method according to claim 1, wherein the registration of the preference on which the information search is based is performed by asking the person who wants to receive the information a question about a predetermined matter and answering the question. 3. The information transmission support method according to any one of 3. 5. The search key is created by including a general element including at least one of age, generation, and recent fashion, together with the registered preference. The information transmission support method according to claim 1. 6. A hardware and software necessary for creating the exhibition information is provided to the transmission applicant for a fee, and the search lock is added to the created exhibition information to be displayed in the digital atelier. 6. The method according to claim 1, wherein:
Information transmission support method according to any of the above. 7. When the basic preference is registered, identification information is issued to the reception applicant, and the reception applicant presents the identification information when accessing the digital atelier from the information transmission network. If
The information transmission support method according to any one of claims 1 to 6, wherein a search key based on a preference registered corresponding to the identification information is used. 8. A process in which a plurality of information is added to a digital atelier accessed from the information communication network as a display information by adding a search lock for convenience of search, and access to the digital atelier from the information communication network is provided. Receiving information about preferences that are the basis for information search from the applicants of the exhibition information and registering the preferences.Based on the registered preferences, a search key for searching for the exhibition information is obtained. Generating, searching for exhibition information to which a search lock matching the generated search key is added, and allowing the recipient to receive the exhibition information; A process of giving prizes according to the number of prize points acquired by the recipient, provided that a predetermined action is taken, and A computer-readable program storing a program for causing a computer to execute a process of charging a fee corresponding to the number of prize points presented to a recipient of the exhibition information to the applicant who wants to transmit the exhibited information. Possible recording medium. 9. An information publishing means for displaying and publishing exhibition information provided with a search lock for convenience in searching as a digital atelier on a site accessible from the information communication network, and an information publishing means from the information communication network. For those who wish to receive exhibition information that accesses the digital atelier, accept and register the preferences that are the basis of the information search, and search for the exhibition information using a search tablet based on the registered preferences. Search key generation means for generating a search key for the search key. The information disclosure means searches a search applicant for a search lock matching the search key generated by the search key generation means. Let me receive the attached exhibition information,
A prize point is provided on condition that a predetermined action is performed on the exhibition information to be received, and a fee corresponding to the number of prize points presented to the receiving applicant is paid by the applicant who transmits the exhibition information in which the act was performed. An information transmission support device, which performs a process of requesting the information. 10. The information publishing means publishes, as the exhibition information, a work of the transmission applicant that the reception applicant can receive free of charge and a product that the reception applicant purchases for a fee. 10. The information transmission support according to claim 9, wherein the predetermined request is to request the recipient to leave a comment on the work and purchase the product based on the received information. apparatus. 11. An exhibition server for displaying a plurality of pieces of exhibition information together with a search lock for convenience in searching at a digital atelier accessed from an information communication network, and a portal for receiving access to the digital atelier from the information communication network. A preference registering means for acquiring information about a preference serving as a basis for information search from a recipient of the exhibition information and registering the preference; and storing the exhibition information based on the preference registered in the preference registration means. Search key generation means for generating a search key for searching, and search for exhibition information to which a search lock matching the generated search key is added from an exhibition server, and receive the exhibition information to a recipient. Prize points will be presented on the condition that the search means to perform the search and a predetermined action on the exhibition information received by the recipient. Prize providing means for giving prizes in accordance with the number of prize points acquired by the exhibitor, and a prize provided by the prize providing means to the applicant for transmission of the exhibition information displayed in the digital studio. An information transmission support device, comprising: a portal server having a fee billing means for billing a fee according to the number of points. 12. The information processing apparatus according to claim 11, further comprising: a support server that supports creation of exhibition information to be displayed on the exhibition server by the caller and generates the search lock.
Information transmission support device as described. 13. The exhibition server, comprising: a library server for displaying the work of the transmission applicant that the reception applicant can receive free of charge; and a mall server for displaying a product purchased by the reception applicant for a fee. 13. The information transmission support device according to claim 11, wherein the information transmission support device includes: