WO2000025234A1

WO2000025234A1 - Database system and search keyword of 5w1h and hierarchical structure

Info

Publication number: WO2000025234A1
Application number: PCT/KR1999/000625
Authority: WO
Inventors: Choonyeol Yu
Original assignee: Choonyeol Yu
Priority date: 1998-10-26
Filing date: 1999-10-19
Publication date: 2000-05-04
Also published as: AU6369799A

Abstract

A database system, utilizing elements of 5W1H of 'where', 'who', 'when', 'what', 'why' and 'how' as data fields or keyword elements for searching for what user want in a computer systems, allowing for establishment of a database and keyword search methods based upon human-beings' activities by setting clearly the reason for activities, the objects substances, the object people, the means, the geographic location and the point in time, additionally making clear the relationships among data or keywords by expressing them in hierarchical structure expressing which data is main and which one is sub supporting the main or which are of equivalent relationships, rather than the existing methods wherein data or keywords are entered without any means for clarifying the relationships among data, thereby enabling to get search results in accurate and speedy manner and consequently contributing to expansion of the usage of computer and internet.

Description

DESCRIPTION

DATABASE SYSTEM AND SEARCH KEYWORD OF 5W1H AND HIERARCHICAL

STRUCTURE

Technical Field

The objectives of this invention to achieve : to set general criteria for keywords and search conditions for document writers and search people as they don't exist. to reduce present inconveniences in searching and accessing data on the computer system, to allow users for setting and searching for keywords by subject in contexts even when data is not written well arranged. To enable to get data on the search engine server arranged automatically without manual and artificial manipulation of data or categories of keywords by expressing data in hierarchical structure, not blindly enumerating them without specific relationships among keywords.

To provide data search with flexibility so that the higher conceptual keyword may be searched for even in case when the lower conceptual keywords which is the one user intend to search for doesnt exist.

This method for keywords is very important. If the application is expanded to the database system and data is entered in hierarchical structure, computer system analyzes and recognizes these structures automatically and during data search search is performed not for just simple words with logic operators matching users entry words but for words covering its mutual relationships among words. Then it may reach to the artificial Intelligence search level technical-wise, getting out of the level of irrational mechanical search. If data in hierarchical structure is cumulated described in an accurate manner and the relationships among all keyword data are included in database surely well then database search operates in an artificial intelligence phase.

To establish search criteria classified into further details by analyzing the mutual relationships among keywords in a subject phrase in context.

To enable to set or search for whatever user wants more systematically by having keywords based upon each element of 5W1H which enables to describe demand, hope, plan, activity patterns with keywords and consequently allows for describing demand of human-beings and supply for it. To classify the keywords into verbs and nouns, nouns being classified further into materials, biographical names, geographical names, time, methods, verbs being classified further into reason, purpose and methods.

To establish keyword systems analogous to human linguistic structure.

To expand the usage of this invention to covering informative data on computer network/telecommunication such as the internet, BBS, email, News Groups, etc with ease of use.

Taking advantage of characteristics of 5W1 H elements and hierarchical structure, to realize the database system for ease-of-use having 5W1 H data fields for data entry and data described in hierarchical structure.

Background Art

As computer is getting into as a part of life and all data in a big organization such as a company tends toward being electronized into computer storages. Also ail of these data are being shared by departments by connecting PCs storing such data through networks . Not only in a big organization but also at even home produces data files amounting to a great volume being cumulatively. This is called intranet or internet in that people share all their information open to the public. As the amount of data gets greatly increased, then the problems in managing and searching data emerge on the surface showing its limitation of current system. The concurrently existing search method is simple but has its native limitation. The concurrent methods for setting keywords on documents are to enumerate keywords plainly using comma (',') without any distinction among them, incapable of describing the relationships of each of keywords. It's natural that there are one or more subjects on document. But, with the keywords being listed without any distinction among themselves in a single phrase, it's hard to understand what each keyword is intended to mean and how each is related to others.

This is associated with very serious problems. Present database system searches data exactly matching search conditions given. Or search conditions may be given flexibility using Logic Operators. Search is executed by setting search conditions with logic operators of AND, OR, NOT. As it lacks describing the relationships among keywords, there is a limit in setting search conditions to get the results exactly of what it was intended for. Both document writers and search users just do enumeration of keywords without deep thought on how to best describe with keywords in a short and accurate manner in absence of specific criteria.

With keywords set in this way by just using logic operators, there is a definite limitation in getting intended results. As it returns tens at minimum or to hundreds of thousands of search results, in order to screen what we want we should search once again with further detailed search conditions or with separate search programs or, in worst cases or in most cases, users have to take a long while with no little efforts to read through all those. Consequently, the necessity clearly arises that we have to have an appropriate means for setting search keywords .

Several search engines use means of making arrangements of keywords on the search server artificially to solve or ease these problems. Namely, if searching a word 'modem', it displays the classified and predefined search keyword groups such as 'modem init strings, modem manufacturers, modem faq, modem strings, etc' all related to 'modem' and arranged manually beforehand, providing people with access to the data with ease thru those arrangements together with search results listing all found. This requires manual artificial arrangements of all data for a search and reveals a limitation in setting search conditions to user's demands. Thereby search results coming out are still inadequate, inaccurate and innumerable. WWW documents on the internet is based on HTML or SGML Specification as a language with the above-explained concurrent keyword system.

Besides WWW as tools for searching and browsing data on the internet, we use News Group posting questions and getting answers to and from others as well as emails exchanging information among people. Nevertheless its advantages, all these are deemed inconvenient for getting the data exactly users want because of its natures of difficulties associated with searching.

On a computer system, various methods exists for searching documents/data for information like by using database programs, using regular expression search programs, bring out help files on the MS Windows OS, using Man page, etc on the UNIX OS, etc.

MS Windows system arranges the contents of documents and has its data accessible through the contents or keywords for search linked to its individual data. In this way, the equation of One content¹ = One data' and 'one keyword' = 'one data' are established, lacking flexibility.

'Man page' on the UNIX describes the details of its individual commands. Such Man pages are organized to be accessible by calling the name of each command. The tool 'info' program is similar to 'man page' with a little bit more flexibility that a document has keywords linked to specific part of the document and display data is to be moved from here to there clicking the keyword as well as thru specific character key moving functions.

All of these 'help' file, 'man page', 'info page', etc have to be made very carefully according to its specific contents or keywords and because of these points it's not so easy to put all ample data to a few keywords and search exactly what wanted. In most cases the user has to read through all the contents or table of keywords to grab first whether what he wants exists or where what he want is. Accordingly its usage is inherently limited. All these reference data systems are in the process of being converted to WWW page format. On the contrary, the principle of this invention is to set keywords on each of the major subjects of the data covering the whole contents of data where keywords comprises the elements of '5W1 H' which is known to be able to describe all activity patterns of human-beings in life and for these features is it possible to set keywords indicating people, material, places, time, price, etc precisely. Furthermore, as it is designed to be able to define the relationships among keywords into hierarchical structures, it has a great flexibility in search of data. For example, in searching for 'HDD', if such data doesn't exist, it will display data on 'computer' which is a higher conceptual word covering the word of 'HDD' at lower level.

Till the wide expansion of use of the internet, the BBS used to be a major tool for exchanging information and it still remains useful to some extent for its high speed of text only data in transmission. This BBS searches data on a constrained part in BBS by file name, id of writer, title or words on a data or by reading all data one by one.

Disclosure of Invention

The principle of this invention is to have data expressed based upon elements of 5W1h composed of why, what, who, how, where and when. These keyword elements (hereinafter referred to as 'keyword elements') are known as suitable for describing human-beings activity patterns. Thus these elements are useful for the puφose not only of data search but also of describing activities/desires of human-beings, consequently helping allow for diverse search and draw out accurate results and eventually drive to increase the usage of computer in life.

The definition and expression of these keyword elements is as follows : a. where : describes geographical locations on the document, namely, the location of the document writers, geographical locations of web pages or object materials, etc. Ex: zip code : 435-047712-1201, Uruk Apt., Koongrae-Doπg, Koonpo-Si, Kyeongki-Do, R. O. Korea

b. who: describes the name of people, company, organization or of people relating to documents, etc. Ex: Samsung Electronics, Sambo Computer>Sales Div>Director> (Kil-Dong Hong, John Samuelson), Daehan Theator

c. when : describes effectiveness of documents or materials, Written date, points in time on the document contents, etc. Ex: Oct.22, 1998, Oct 22/1998, 10/1/1998 - 10/31/1998

d. what: describes objects on the documents. Ex: Gone with the wind, CPU>Cyrix>(486DX2-60, 486SX) e. why: describes reason, purposes, etc. Ex: To buy, To sell, To meet, For reference

f. how: describes means or methods of such as payment terms, delivery methods, price, etc. Ex: mail, EuroExpress, W250,000 - WS0O.000, per lOOOpcs

Keyword Elements and the methods for keyword expressions/representations

Following are the detailed descriptions on the principles of this invention and examples. Example 1 is a summary of a document

Ex 1.

1) Writer : Choonyeoi Yu/ehaho

2) Written Date : January 11 , 1998 3) The business place : Sejong Apt., Dangjeong-Dong, Koonpo-Si, Kyeongki-Do.

4) Products for sale

Product Description Spec. Price Price Effective

1MDRAM (256KDRAM x 4) $5 Jan. 20 1MDRAM (1M x 1) $10 Jan. 31

256MDRAM $20 Feb. 28 Delivery Conditions : Airmail Express

5) Travel Services:

Travel Package Services

Destination Description Price Price Effective Jejoo Island 2 nights $200 Jan. 20

London 6 nights $1000 Jan. 31

Conditions : Group Travel Availability : till Jan. 18

6) Let's play tennis Place : Tennis court at Kumjeong-Dong, Koonpo-Si,

Date/Time : Jan. 14, 1998

Contact : Tel. 02-389-2550 email : choon@ehaho.com Etc : contact me till Jan. 13

In the above document are information on the document writer, some of memory semiconductor products for sale, travel service products for sale, hobbies, etc. In order to have all these information described in limited space with keywords, if s mandatory to have systematically well designed methods for description of keywords.

The above example is re-expressed as follows being converted with this invention :

Ex. 2

1) who : Choonyeoi Yu/ehaho why: for reference when : Jan. 11, 1998 where : Keyongki-Do>Koonpo-Si>Dangjeong-Dong>Sejong Apt. 2) why : for sale, to sell what^': 256MDRAM (how: $20 when : Feb. 28),

1 MDRAM>256KDRAM x 4 (how: $5 when: Jan. 20), 1M x 1 (ho : $10 when : Jan. 31) how : Express Delivery when : till the end of March

3) why : to go, to travel what : travel service products where : Jejoo Island (how : 2nights, $200 when : ~ Jan. 20),

London (how : 6 nights, $1000 when : ~ Jan. 31) how : Group Travel when : till Jan. 18

4) what : Tennis why: to play where : Tennis court at Kumjeong-Dong, Koonpo-Si when : Jan. 14, 1998

The above can be converted into as follows in accordance with concurrent keyword method.

Ex. 3

1) Choonyeoi Yu/ehaho Jan. 11, 1998

Sejong Apt., Dangjeong-Dong, Koonpo-Si, Kyeongki-Do

2) 256MDRAM, $20, Feb. 28 256KDRAM x 4, $5, Jan. 20, 1M x 1, $10, Jan. 31 Express Airmail till the end of March 3) to go, to travel,

Jejoo Island 2nights, $200, ~ Jan. 20

London 6 nights, $1000, -Jan. 31

Group Travel

Jan. 18 4) Tennis, to play,

Tennis court at Kumjeong-Dong, Koonpo-Si,

Jan. 14, 1998

EΞx. 3 shows keywords just as they appear. Although keywords in the same context are grouped in each number, it's found that all words in this example are treated all in the same way and considered to be of all the same level in context that leads to inability to distinguish what is what and which is related to which others. In 2) we couldn't make other people know surely $20 is for which product for example. In any ways whatever it is including logic operations with AND, OR, NOT, we find with ease that it's impossible to describe the relationships among keywords not only in each context but also on the whole document. Furthermore, we can't distinguish the relations of each of words. In contrary, keyword expression in EΞx. 2 describes accurately the whole contents of the document in brief as well as the relationships among keywords. Eg, the product description of 256MDRAM, its price and price effectiveness are well represented indicating the whole relationships of themselves and relationship with others like 1MDRAM, etc.

The principles of this invention as indicated in the example 2 on how to set keyword elements and its keywords may be summarized as follows :

- describe key subjects of the document in the 'as is' phrase form. Each of key subjects become a keyword group (hereinafter referred to as 'keyword group').

- analyze the words of key subjects in each keyword group and classify into keyword elements of 5W1H comprising 'why', 'what', 'who', 'how", 'where', 'when'.

- enumerate the keyword elements without using 'comma(,')' between each with keywords next to ':' following each keyword elements.

- If necessary or required to describe further details related to the keywords under keyword elements, put lower conceptual keyword elements with keyword following under each of the primary keyword elements with an appropriate delimiter like in the parenthesis distinguish each level of keyword elements. This is exemplified in 2) of EΞx. 2.

The methods for describing keywords per each keyword elements are as follows :

- Among keywords there needs mutual relationships to be described distinctively as higher, lower or equivalent conceptual words. This is a hierarchical structure. The higher or lower conceptual hierarchical structure is described with '<' or '>' and the equivalent with comma (',^*).

- if necessary group keywords in parenthesis. Keywords in the parenthesis has higher priority than other keywords distinguished with comma (,) or comparison operator '>' or '<' in mathematics

The benefits obtainable from this hierarchical distinction of keyword elements and keywords are it eliminates the necessity of manual arrangements of the data or keywords into specific order which are desperately required as in the existing search engine systems and with this invention were such jobs done automatically. The appropriate example is an geographical addresses where each address words are described in hierarchical structure. The names for road or for cities are automatically sorted according to the relations between cities in the state, as higher level, and roads in the cities. The roads in a city are of the equivalent conceptual words and cities in a state are of the same either.

-Expressing data in a hierarchical structure form plays very important roles in this invention. Human-beings life is knowingly or unknowingly in a hierarchical structural format as in 'family members<family<(company, organization, community)<society<country or member<section<department<division<company. In concurrent database is data to be entered indicating the relationships of such as possessions, positions, etc of the data one by one. But, in contrast, this invention eliminates the necessity of predefining the relationships of data or data field elements beforehand by having data described with the relationships of data in hierarchical structure at the point of data entry. This is analogous to human-beings' life. Following example shows well the expression of data in this hierarchical structure and its effects.

John>(computer>(486, notebook(>pentium> 100MHz), printer) Mary>(computer>pentium ll(>by Taiwan company)

Sales Dept.>(John, Mark, Bob, Douglas) why : bought what : computer>pentium II when : Sep. 3, 1999

The above is for certain sales department. It expresses what belong to John and to Mary respectively and both John and Mary is in Sales Dept. Accordingly it's noted at a glance that the computers, etc belong to Sales Dept . if data is entered in accordance with concurrent database methods, the data in the bottom line should be entered by bringing out the data by the data field of Mary, Sales Dept., etc. This invention doesn't require it. It's simple and easy. It shapes in artificial intelligence. It exemplifies the effectiveness of data in hierarchical structure.

Following is an example of keywords on the WWW page.

Ex. 4 <META name=keywords contents=who:Choonyeol Yu, ehaho why: for reference where:"437-045, (Kyeongki-Do>Koonpo-Si>Koongrae-Dong>Uruk Apt.)" =why:"to go" (whatMount. Soori when:"Jan/01/98")] =why:"to play" (what: Tennis when:"Nov/01/98" )]

=why:"to sell" (whafctv (who: LG how:"$500"),

(who: Samsung how: mail, $501)

), (computer (who: ehaho how:"$1,000", mail), (who: Sejin how:"$2,000", Door to door)

)

This invention will enable the maximization of the use of computer systems eventually. For example, the concurrent search engine accepts keywords on the contents of home pages for searches and execute the simple search roles. But, with this invention, descriptions as following :

<why: to get friends what: woman>"age: 20-25", 160cm tall> <why: to exchange what: modem, how : with glasses> is registered in search engine server. Then other people will search and find them on the internet and they will do deals to each other's satisfaction.

Another example for use of this invention is that those who use email only without home page may send message saying <why: to sell what: book>iinux>network how: $30, email:seller@uruk.com> to the search engine built with this invention. The search engine have it in search database. Other people wanting to buy matching the above condition search the database will find it. The transaction will be achieved successfully by sending email message to the above email address. This kind of diverse function can be achieved only by this invention equipped with the features that can set accurate search conditions and thereby search results is obtained in a accurate manner only.

Methods for searching keywords

Search conditions may be set as follows in case of the above EΞx. 2 :

EΞx. 5 where : R. O. Korea>Kyeongki-Do what : 256KDRAM x 4 how : $4 - $5.5

Then, companies who sell on the condition matching the above keywords, saying 256KDRAM x 4 at the price ranging $4 - $5.5 from in Kyeongki-Do, R. O. Korea, will be displayed as the search result. Users is to enter the search keywords for one purpose in mind. Search is executed for one keyword group with priority and considers other groups when/if necessary.

If setting search keywords as follows :

EΞx. 6 where : Kyeongki-Do>Koonpo-Si>Dangjeong-Dong why : to play what : Tennis when : Jan. 14, 1998>14 O'clock

and data matching 'why : to play' for the location in Dangjeong-Dong doesn't exist. Then search result will show the data matching the location of the higher structure, 'Kyeongki-Do'. Human-beings' language comprising the subject, the predicate, the complement and the objects used in daily life is structured similarly corresponding to the elements of 5W1H. Namely, the subject corresponds to 'who' or 'what', the predicate to 'why', the complement to 'how", 'where' or 'when', the object to 'what' or 'who'. In this principle may the above search keyword conditions be changed into as follows :

EΞx. 7

'to play tennis on Jan. 14, 1998 in Kyeongki-Do>Koonpo-Si>Dangjeong-Dong

We will find that the search method of this invention is exactly based upon human-beings activity patterns and in the linguistic structure.

The following is set based upon concurrent search keyword methods with logic operators.

Ex. 8

'to play AND tennis AND (Kyeongki-Do OR Koonpo OR Dangjeong-Dong) AND Jan. 14, 1998^*

Ex. 9

'to play OR tennis OR (Kyeongki-Do OR Koonpo OR Dangjeong-Dong) OR Jan. 14, 1998'

We will find in Example 8 and 9 how much hard it's to get exactly what we want to search for with existing methods with logic operators. We easily find that 'to play¹, 'for reference' correspond to 'why' of this invention, 'tennis' to 'what', the geographic name 'Kyeongki-Do' to 'where' and 'Jan. 14, 1998' to 'when'.

Applying this invention to the documents on the PC or BBS, we will benefit a lot from its outstanding conveniences. The difference is that the WWW language grammar requires to put the keywords in the 'HEAD' element with the <META> tag in the heading parts of the WWW page. In PC or BBS doesn't require such conditions. We may describe keywords in the part of the file defined or required by the programs, search the documents for the keywords and move to the part of data linked to the found keywords.

Following are examples representing how to set the keyword search conditions on the PC. Differently from on the WWW, 'what', 'how¹ or 'why' out of the whole 6 elements of 5W1H are mostly used. why : to change what: Outlook>directory>(maii, data) where : to the other why: to fetch what: Outlook>mail>message>new where : mail server why: to filter what: Outlook>mail>message why : to repair, for reference what : modem>error>'no carrier detected' why : to configure what: linux>ppp>options

You will notice from the above that they construct the contents of the document themselves not just as keywords. It's very inconvenient to use.

Still IP business providing information on a commercial basis on the BBS is being used popular, even though being phased out. The core of this IP business is to provide customers with the capabilities of providing information on demand and search them quickly and easily. This invention is suitable for these purposes.

One more point to notice is that although all above explanation was focused on the 'keywords', it doesn't mean that this invention is just for keyword searches. Keyword is a part of database as seen above. And this invention functions as a kind of a database system by itself.

Following EΞx. 10 represents database programs based upon concurrent methods.

Ex. 10. Database based upon concurrent methods.

Data base A. (Personnel Records) Name Address Tel# Date Dept. Mobile Phone# e-mail a Seoul>Singil-Dong 8920000 0901 Sales 0117232341 a@hanmaii.net b Seoul>Gajoa-Dong 72312000901 Finance 0165667423 @hanmail.net c Seoul>Segog-Dong 34842000901 Cost 0118902311 c@email.com d Gyeonggi-Do>Goonpo-Si>Sanbon-Dong 3982511 0904 Sales d@email.com

Database B (Purchase, EΞxpenses)

Name EΞxpenses Date Company Description b 10000 0901 GM Co. HDD c 15000 0902 Gumseong Repair legs of Desk a 2000 0920 Sejin Elec. Purchase Jack for Telephone a 10000 0928 Hanyang Restaurant Entertain Clients at dinner Database C (Budget) Dept. Month Monthly Budget Budget turned-over Sales 7 200,000 150000

Finance 7 300000 10000

Database D (Bank in transaction) Bank Account # Place Dept.

Commerce Bank 23456 Songpa-Gu Finance Googmin Bank 12345 San-Gu General Affairs

Program consists 4 small ones for data entry. Among programs exists at least one common data field to share with others, it looks very simple. But it wastes data with common data fields. This invention may reconstruct these programs into one program having elements of 5W1 H as data fields. Following EΞx. 11 represents this case, converted from the above E≡x. 10.

EΞx. 11 Database with 5W1 H elements of this invention as data fields

wwhhyy wwhhaatt wwhhoo how when where buy Telephone>Jack a 2000 0920 Sejin Elec. buy Computer>HDD b 10000 0901 GM Co repair Desk>legs c 15000 0902. Gumseong calculate Budget Sales 200,000 9 CCaallccuullaattee BBuuddggeett Finance 300,000 9

Calculate Budget>last month Finance 10,0000831 Calculate BudgetHast month Sales 150,0000831 Entertain Dinner Sales>a 10000 0928 Hanyang Restaurant record Personnel Sales>a Join>0901 Address: Seoul>Singil-Dong tel: 8920000 h-phone#:0117232341 email: a@hanmail.net record Personnel Finance>b Join>0901 Address:

Seoul>Gajoa-Dong tel: 7231200 h-phone#:0165667423 email: b@hanmail.net recordPersonnel Cost>c Join>0901 Address: Seoul>Segog-Dong, tel: 3484200 h-phone#:0118902311 email: c@email.com recordPersonnel Sales>d Join>0904 Address:

Gyeong-Do>Goonpo-Si>Sanbon-Dong, tel: 3982511 email: d@email.com recordOrgan. (Sales. Mktg.AS)<Sales Div. Effective: 0101 recordOrgan. (Finance. General Affairs)<Admin Div. Effective: 0101 record Bank> Account*: 23456 Finance Songpa-Gu>Commerce Bank record Bank>Account#: 12345 General Affairs San-Gu>Googmin Bank

* Preset conditions : EΞxpenses =(buy, repair, entertain)

Data looks complicated but to the extent that computer may recognize enough. Many data fields are replaced with elements of 5W1H, hierarchical structure composing <, >, 0 and commaO and placing additional lower data fields further inside each 5W1H element (Oil: address, tel, mobile phone no, email address). It reveals the relationships among departments by describing following into data :

- (Sales, MKTG, AS)<Sales Division

- (Finance, General Affairs)<Admin. Division The further details which can not be described in full in accordance with 5W1 H are filled by putting additional supplement fields of lower concept like 'join>0901' or 'address', 'tel', 'mobile phone', 'email address', etc.

Best Mode for Carrying Out the Invention

As described in the Description of Invention.

Industrial Applicability

This invention establishes the criteria for how to set keywords and enables to search a huge amount of data easily and quickly for what we want by the simple elements of 5W1 H based on human-beings' activity patterns, replacing the existing methods that we enter the keywords for search without distinctive criteria. Also, it enables to establish search conditions similarly structured to human-beings' language. The hierarchical structure of search keywords enables to sort keywords automatically in order using the analysis of the mutual relationships of keywords, eliminating the manual manipulations. It sets the diverse relationships among keywords and returns search results not only looking for ones matching exactly the search keywords but also considering keyword relationships in higher, lower or equivalent conceptual structures, This provides easy-to-use features compared to existing search methods and saves users a lot of time, efforts or money.

On the Internet or BBS to search for data, we have to search at the search engine home page or related position on BBS and move to a site through the links made with search results. We need to do search once again at the point to find out what we finally want. The representative example for these cases is shopping malls. But, with this invention, the borders among home pages are collapsed down. On one search engine or on one menu command prompt, we are able to search in detail covering all sites.

The present usages of the internet range servicing with news articles, information on law, organization, science technologies, etc, information on goods for shopping (for transaction or exchange purposes) and using as gates to the communication channel among people, etc. For this, such as News Group, WWW, email service, ftp, chatting, etc are in use widely and in various types. Each of these has its own specific strong points and weak points. The principal features of this invention may replace major parts of roles having been performed by all these, stressing its strong points only.

Describing keywords on the key subjects of WWW documents and enabling searches by the subject make internet not as the passive toots for simply searching data but as an active tools for buying or selling products, exchanging things, matching people with the similar hobbies, etc, expanding its usage and roles to a great extent. we are able to enter data on the document partly as keywords specifying the products, product descriptions, prices, etc for sale and are able to search not within the limited boundary of certain shopping malls but beyond countries' borders to worldwide. Users are able to do shopping in a geographically limited small area or over world wide however they want. This will lead users to extreme satisfaction and will influence positively to the expansion of the internet usage. Economically as a major benefit, this will enable people to purchase the most competitive products worldwide.

If we adopt these features onto both computer and onto internet, it incorporates those two into one system with the same search interface. This will eventually maximize the usage and the conveniences of the computer and the internet. Besides, on the search engine, we are able to search people, have email send at the pre-set time, post a question and receive answer, etc. Its effect will prevail. This will evolutionize the usage of computer, network and internet to the extreme.

It's possible to make a simplest but very convenient database system wherein the elements of 5W1H only are used as data fields, data is entered in a hierarchical structure and search is executed on those data fields of 5W1H and data based upon hierarchical structure.

The strong points of this database system are as follows :

- Database is constructed simple. The entire data can be entered thru one record format and therefore it doesn't require plurality of programs be built. Programming is made simple. - The relationships among data gets clear as data is cumulated.

- This is a future oriented database system equipped with the features of artificial intelligence and having normal text and normal linguistic structures.

- It doesn't require additional maintenance works to the programs for modification and additional administration works to data. - It's possible to put all data into database. It enables easy administration and removes wastes of data by centralization of the data.

- It builds a database system not in the format of complicated data managements. T e novice may use it with ease.

Claims

1. A database system comprising data field means for naming data fields and data means for being entered under each data field means, wherein said data means are characterized by being expressed in hierarchical structure.

2. A database system as cited in claim 1 , wherein said data field means comprise at least two of : a. why means for expressing reason or purpose, b. what means for expressing object materials, object substances, c. who means for expressing people doing actions, the object people or a group or an organization of people, d. how means for expressing methods or means relating to or supporting the other elements, e. where means for expressing location or place and f. when means for expressing time point,

3. A database system as cited in claim 1, wherein said data means comprise being expressed in hierarchical structure expressing upper, lower or equivalent relationships among data means.

4. A database system comprising data field means for naming data fields and data means for being entered under each data field means, wherein the data fields comprise at least two of : a. why means for expressing reason or purpose, b. what means for expressing object materials, object substances, c. who means for expressing people doing actions, the object people or a group or an organization of people, d. how means for expressing methods or means relating to or supporting the other elements, e. where means for expressing location or place, and f. when means for expressing time point.

5. A database system as cited in claim 4, wherein said data field means is expressed as why, what, who, how, where and when respectively.

6. A database system as cited in claim 4, wherein said data means further include being expressed in hierarchical structure expressing upper, lower or equivalent relationships among data means.

7. A database system as cited in claim 4, wherein said data means comprise keywords on the WWW documents.

8. A database system as cited in claim 4, wherein said data means further includes being expressed in a way that said data means have subsequent said data field means having said data means under itself, and the data means under each subsequent said data field means have further subsequent data field means and so on.

9. A database system as cited in claim 4, wherein said data means across said data field means further includes being expressed in text structure of general language, taking advantage of the characteristics of grammatical structure of the said data means.

10. A database system as cited in claim 4, wherein said subsequent data field means in claim 8 comprise said why means, what means, who means, how means, where means and when means.

11. A method for setting and searching keywords on WWW document/data characterized in that wherein keyword element means comprise at least two of : a. why means for expressing reason or purpose, b. what means for expressing object materials, object substances, c. who means for expressing people doing actions, the object people or a group or an organization of people, d. how means for expressing methods or means relating to or supporting the other elements, e. where means for expressing location or place and f. when means for expressing time point, keywords are written per each of the said keyword element means in accordance with data entry means for entering data, said keywords have further following 2nd subsequent keyword element means under itself or further a 3rd, 4th or so under each keyword per each of subsequent keyword element means, when required, in case that said WWW document/data is made up of a plurality of subject sentences in context, then each subject sentence forms a keyword group and said keyword element means are described per keyword group, keywords are written per each of keyword element means, and search is performed on these keywords in accordance with search means for searching data.

12. A method for setting and searching keywords on WWW document/data as cited in claim 11 wherein each of said keyword element means is expressed as why, what, who, how, where and when respectively.

13. A method for setting and searching keywords on WWW document/data as cited in claim 11 wherein said data entry means for entering data includes that said keywords across keyword element means are described further in normal linguistic structure, taking advantage of grammatical characteristics of the words used as keywords in each keyword element means.

14. A method for setting and searching keywords on WWW document/data as cited in claim 11 wherein said search means for searching data includes that said keywords to be entered for search across keyword element means are described further in normal linguistic structure, taking advantage of grammatical characteristics of the words used as keywords in each keyword element means.

15. A method for setting and searching keywords on WWW document/data as cited in claim 11 further including defining the relationships in hierarchical structure among keywords per each keyword element means indicating higher, lower or equivalent conceptual relationships among said keywords.

16. A method for setting and searching keywords on WWW document/data as cited in claim 11 wherein said keywords further include being described in the BODY element as part of a context.

17. A method for expressing data in a computer system wherein a means for entering data in a computer system is characterized by being expressed in hierarchical structure indicating upper, lower or equivalent conceptual relationships among said data.

18. A method for searching data in a computer system comprising following steps : analyzing data means for being entered in hierarchical structure indicating upper, lower or equivalent relationships among said data means, executing search, based upon said analysis, on said data means and returning search results including data of upper, lower or equivalent conceptual relationships.