KR100583011B1 - Communication system and method - Google Patents

Abstract

The present invention relates to a communication system and method for linking a plurality of tagged objects to information services stored in a network, respectively. The system provides means for reading one of the object tags or objects and means for retrieving information about objects stored in storage means located at any location. To facilitate retrieval of information, directory means is provided to store object data that associates each object with an information service. To enable virtually any number of objects and information services to be coordinated, the directory means comprises a plurality of directory servers, each storing a part of the database of object data. The object data is distributed to a plurality of directory servers in a predetermined manner so as to be able to identify a directory server storing object data related to a plurality of read object tags.

An application server, a system kernel, a directory server, a data processing unit,

Description

[0001] COMMUNICATION SYSTEM AND METHOD [0002]

The present invention relates to a system and method for communicating information within a network, and more particularly to a system for communicating information about multiple tag objects within a network.

Recently, data communication technology is rapidly developing. Electromechanical equipment that communicates information over long distances is now being extensively replaced by digital systems using semiconductor switches. Due to the availability of inexpensive data processing capacity in today's world, it is actually possible for everyone today to communicate voice and audio signals as well as data, databases, etc. stored on a computer. With the advent of computer networks such as the Internet, which actually connect virtually every computer in the world, easy and inexpensive access to digital information has become possible globally.

The Internet and other similar networks may be used for various applications. For example, it is possible to retrieve information about a particular topic by an accessing file that can be physically located anywhere in the world, essentially. The file may include text, audio signals, images, video, or data related to the application.

In order to be able to access these files, it is necessary to know the document name and furthermore to know the address of the network computer storing the document. However, in many cases, the information about the name and location of the document related to the desired topic or physical object is unavailable, thus requiring a means for retrieving information about a possible location of the application or document associated with the topic. Thus, in most common networks, various applications are available that support the user in identifying the address of the server storing the document name as well as the document associated with the object.

In general, a support application performs a more detailed or less detailed network discovery based on a set of keywords or keywords provided by a user. The search result is generally a list of links and addresses to the server that store information related to the desired topic. The user can select each record in the list and retrieve the associated document or service. However, in many cases, a very long list of addresses and links will be returned and only a small number will actually be found to be related to the desired topic. The keywords provided to the search application often generate a list with thousands of entries, and many entries in the list are intermittently related or not at all related to the object.
Thus, retrieving information from the network may be a tedious and time consuming task, and the results may be unsatisfactory. This situation is further exacerbated by the rapid growth of such networks.

delete

There are essentially two reasons that make it hard for a user to retrieve information about a particular object. Although the user may know certain key facts about the desired object, the search may miss important information about the object, secondly the key information for the desired object is often insufficient, and therefore the information about the object the user wants to search for , It is impossible for the user to specify an appropriate search term. The user is also faced with the problem that it is impossible to obtain a determined response as to whether the desired information is available on the network, i.

Thus, in order to reduce the number of " hits ", it is desirable to design a system that easily dispatches intensive information about a particular topic or object without the need for time consuming network discovery due to the complex arrangement of search terms .

In the physical world, there are a number of different objects, artifacts, or natural objects, and similarly, in a virtual world of computer networks, virtually all information about physical objects exists. However, as described above, it is difficult to retrieve information related to a specific object. Therefore, there is a demand for a system that links physical objects and information space services.

A number of proprietary systems are known from everyday life that allow a limited number of objects to be connected to information about objects. For example, such a system may link vehicle spare parts to information in the database. The part number can be entered into the system and the drawing, and information on availability, price, etc. is returned. A similar system is in the supermarket. Such a system may display information related to the object under investigation, or may consider sales items, prices, and the like.

However, all of these systems have various limitations regarding the scalability and associated information services, robustness and generality with respect to the number of objects.

Moreover, a " broken " link, i.e., a link and address that is no longer valid and stored by the user at one point, causes problems in the computer network. The location of the information or service, i.e. the address of the computer of the network storing the information or service, as well as the filename generally change with the passage of time due to rearrangement of servers, network addresses, In this case, the address or link called to retrieve a particular service from the network may no longer be valid, and an error message is returned to the user. Obviously, therefore, it is desirable to prevent aborted links in order to be able to retrieve information about the object without failures.
CONF. 12, Feb. 26, 1996, No. 26, March 1996, No. 2, February 1996. [0001] This application is a continuation of CIM Databases, 1996, pages 142-150) discloses a directory approach for large associations of databases in which object movements respond to manufacturing events. According to the directory method, the object reports its location to the distributed directory server to avoid problems during query processing. The object may be identified on a distributed directory server using a pair of hash functions based on an indicator for determining whether a pair of hash functions should be applied to the object ID.

It is therefore an object of the present invention to provide a system and method for communicating information relating to any number of objects.

This object of the invention is solved by the independent claims 1 and 15 of the present invention.

The present invention is useful for linking any number of objects in the real world to any number of data processing units or information services stored in an application server that can be located anywhere. These services may be text, images, application programs or any other kind of message. The data processing unit or application server preferably stores a plurality of application data packets containing data related to the service. Each of the plurality of application data packets may be associated with one of a plurality of objects in the real world, i. The application data packet may be of any size.

Each of the plurality of directory servers is useful for storing a portion of an optionally measurable database containing object data that combines each object with one or more application data packets. A number of directory servers act as key resources when retrieving application data packets associated with an object. Means are provided for receiving the read object tag from the reading means, storing the object data associated with the read object tag, and identifying the directory server to retrieve the object data. In operation, the system kernel receives data of an object tag associated with one of a plurality of objects and, based on a search performed by at least one of the plurality of directory servers, determines the address of the storage location (s) Lt; RTI ID = 0.0 > application < / RTI > The application data packet can then be retrieved and supplied to the device. The device may be a mobile phone or a data processing unit or the like. Alternatively, object data associated with the read object tag may be transmitted to the device. Thus, the present invention is useful for connecting different services from different providers.

In a useful embodiment of the invention, each of the plurality of directory servers comprises a tag memory means for storing information as to which of a plurality of application data packets a particular object of the plurality of objects is associated with. Thus, it may be useful for the tag data block to include one or more object tags and one or more application identifiers. The tag data block may also include an address of an application server that stores an application data packet corresponding to the application identifier.

Each directory server may also include address memory means for storing an address data block containing information about an application server address storing application data packets specific to the tag memory means. An address data block may be provided for each application data packet. Thus, the address data block may be useful for storing the application server address and application identifier of the server storing the corresponding application data packet. The address data block may also store the object tag of the object associated with the application data packet. The address data block may be usefully used to remove the application identifier from the object data when the corresponding application data packet is removed.

The tag memory means and the address memory means are useful for solving the problem of the suspended link because the object can be indirectly linked to a specific storage location, i.e. the address of a particular application server, via its own tag. Thus, the search for a particular application data packet associated with a particular object can be advantageously performed by searching for a particular object tag in the tag memory means, and then an application server address for each application identifier can be retrieved from the address memory means.

In another embodiment of the present invention, it is useful that the system includes memory means for storing a list of directory servers available in a hash table, and it is also possible to use a specific server among the directory servers storing information related to a specific object based on the hash table A hash function is provided to identify it. The hash function is used to map all object tags to multiple directory servers. Thus, the hash function may include storing and removing one of the object tags and associated object data, retrieving object data associated with one of the object tags from one of the directory servers, and relocating the object tag from one of the directory servers to another. Lt; / RTI >

It is useful that all object tags and directory server addresses are numbered in ascending order, and the tag data blocks of object tags with sequential numbers are stored in a directory server with sequential numbers, and all uses The list of possible directory servers, that is, their addresses, is maintained as a hash table. Thus, a directory server that stores information related to a particular object can be identified by a hash function. The determined directory server may store object data related to the object tag. If object data is not stored, the output range of the hash function may be halved.

When an object is inserted into the database of object data, the appropriate directory server can be usefully computed by a hash function. Moreover, when a new directory server becomes available and inserted into a hash table, the storage location of the application data block may be usefully recalculated using a hash function.

Preferably, the hash table is stored by one or more monitoring servers, but any other component of the system kernel may store a hash table or a copy of the hash table. Thus, it is possible that a copy of the hash table is stored in a directory server or the like. A copy of the hash table can only be updated periodically to reduce processing time.

Providing a copy of the hash table to multiple devices of the system further reduces the response time of the system because the search operation can be performed by multiple devices.

Moreover, a number of mediation servers may be provided for storing information about the components of the system kernel. The mediation server may also store a copy of the hash table.

Advantageously, the retrieved application data packets can be communicated to a data processing device used to play or display information, or via fixed and wireless communication links to a mobile phone. Data conversion, such as voice processing, can advantageously be performed by a resource means that is specifically provided.

Moreover, in order to provide a robust system, components of the system kernel may be replicated by the replication component.

Yet another advantage of the present invention is described in the dependent claims.

The invention may be more fully understood in connection with the accompanying drawings.

1 is a block diagram of an embodiment of the present invention;

Figure 2 illustrates one embodiment of a hash table used to perform a search operation to identify a particular directory server of a directory server;

2A is a flowchart of storing, retrieving and relocating object data associated with an object tag executed in accordance with an embodiment of the present invention.

3 is a flow chart of retrieving an application data packet associated with an object executed in accordance with an embodiment of the present invention.

4 is a flowchart of a step of identifying a directory server storing new object data in accordance with an embodiment of the present invention.

5 is a block diagram of one embodiment of the elements of each of the tag data block and address data block as well as one of the plurality of directory servers.

Figure 6 illustrates one embodiment of a system kernel;

Figure 7 illustrates one embodiment of a system according to the present invention including the Internet.

Figure 8 schematically illustrates one embodiment of a step of implementing a method according to the present invention;

9 schematically illustrates one embodiment of a step of implementing a method according to the present invention, including the Internet.

Figure 10 shows another embodiment of a step comprising a retrieval procedure executed by a mediation server executing a method according to the present invention;

11 shows another example of a step of carrying out a method according to the present invention involving data transformation executed by a resource means;

Hereinafter, preferred embodiments of the present invention will be described with reference to the drawings.

Figure 1 shows a block diagram of one embodiment of a system according to the invention. The system is arranged to link to each of a plurality of objects and a corresponding service of a plurality of information services.

The embodiment of Figure 1 includes a system kernel K with one or more application servers AS1-AS and a plurality of directory servers DS1-DSn. The system kernel K is arranged to communicate data between a number of application servers and telephone (M), data processing unit (DPU) and the like. Each of the application servers has an address (IS1-ISp) and stores a plurality of application data packets each having an application identifier (AI1-AIm). The application server may be part of a known datacom or telecom network, such as the Internet. A plurality of objects D are represented by a plurality of tags T shown respectively. A reader R is provided for reading the data of the object tag and transmitting the same to the system kernel K. [

The system is arranged, for example, to link a number of objects, which may be any product or item in the physical world, to various kinds of information related to the object. Thus, it is possible to associate each specific object with a set of focused information services. The user can retrieve information about the information service by reading the object tag T (Tl-Tw) using a set of such information services or a reader R associated with a particular object D. [ Information about the object is then automatically obtained by the system kernel K from a corresponding one of the application servers. The obtained information may be sent from the system kernel to the telephone (M), which may be a conventional telephone or mobile telephone, or to a data processing unit (DPU).

By means of a system according to the invention, the user can access default information relating to, for example, a specific object or a group of objects or objects as provided by the manufacturer of the product. Moreover, the user can execute a specific service related to the object. The user can also browse a list of services that are available to the object, e.g., services associated with the object, and browse the list. In this case, a list of all services associated with the object may be displayed on the display of a data processing unit (DPU) operated by the user, for example. The system can also be used to automatically read an object tag, for example, in a room or through a door or the like.

A number of application servers having addresses (IS1-ISp) and storing data relating to object D may be located anywhere in the world, similar to an existing computer network, such as an intranet, an in-house network, or the Internet. It is also possible that some or all of the multiple application servers constitute part of one or more known datacom or telecom networks, and that only the system kernel K acts as a link between objects and services. Thus, the application server may be a dedicated device or may be shared with other networks. The data stored on the application server may be text, for example, a user manual of the product linked to another server storing related data or other kinds of record information. Moreover, the data may include images, video, audio signals, and the like. It is also possible for the exchange of data via the system kernel K between the application server and the mobile telephone and / or data processing unit to involve interactive execution of the application.

The reader R is arranged to read one of a plurality of object tags T (T1-Tw). The reader may be a barcode reader or any other reader. The object tag can be an active or passive tag as is commonly used, and is preferably very small. mm is currently available.

The reader R may be an independent device (PCMCIA size) connected to the mobile telephone M and / or the data processing unit DPU or may be a dashed line containing a reader, mobile telephone M, data processing unit DPU, Or may be integrated into the mobile telephone M and / or the data processing unit (DPU) as shown in Fig. To read the object tag, the user preferably directs the reader to the object tag and initiates the read process. However, it is also possible that the object tag is automatically read, for example, when it is near the reader.

The transmission of information between the reader R, the mobile telephone M and the data processing unit DPU and the system kernel K can be performed via a fixed communication line or via wireless communication. For example, data transmission may include mobile telephone networks, telephone networks using fixed lines, and computer networks.

Although Figure 1 shows only one reader R, the system can serve multiple users operating multiple readers. The user can be located at any location, and the only requirement is for the user to issue a request for information and connect to the system kernel that sends the read object tag. Preferably, each user may be provided with an apparatus for receiving information retrieved from one of a directory server or an application server, which may be, for example, a mobile telephone (M) or a data processing unit (DPU).

In operation, the system kernel K receives a request for information from a user comprising an object tag (T; T1-Tw) of the object D read by the reader R. Upon receipt of this request, the system kernel K performs an operation to identify the application server storing information related to the object D. If the application server and the address IS (IS1-ISp) are respectively properly identified, the data related to the object D can be retrieved from the application server and provided to the user.

The amount of data to be adjusted by the system, i. E. The number of objects and the number of application data packets, can be too large so that a single unit can not coordinate all information relating an object to an application data packet. Thus, the system kernel K includes a number of directory servers DS (DS1-DSm), each storing a portion of a database of object data that associates each application data packet with one or more multiple objects.

It is desirable to provide a means to maintain information about the available kernel components. Typically, the information may be maintained in any component of the system kernel. However, one or more dedicated monitoring servers (not shown) may be provided for this purpose. The number of monitoring servers may depend, for example, on the traffic adjusted by the system. The monitoring server / servers may, for example, always maintain an up-to-date list of addresses of all directory servers. Also, periodically updated copies of the list may be stored elsewhere in the system kernel.

The key aspect of the present invention is that the database of object data is distributed in a number of directory servers (DS1-DSn), and the number of objects is almost arbitrarily measured by adding a new directory server to an existing server storing new object data . Each directory server DS (DS1-DSn) preferably stores object data related to a small number of available object tags (Tl-Tw). As mentioned above, the object data associated with the object tag preferably includes an application identifier (AI1-AIm) of the application data packet associated with the object, as well as a storage location of the application data packet, e.g., an application server (IS ; IS1-ISp).

According to one embodiment of the present invention, retrieval of application data packets by the system kernel K may be performed in two steps. In a first step, a directory server storing object data related to the object is identified and the object data is retrieved. In a second step, using the object data, an application data packet is retrieved from the application server and / or object data, or a portion thereof is sent to the user, i. E. To the mobile telephone (M) and / or the data processing unit do.

The first step of identifying the correct directory server may be performed through a search of a hash table H that includes the address or identifier of all available directory servers DS1-DSn. To facilitate this search procedure, a hash function is used.

The hash function is used to map multiple objects to multiple directory servers (DS1-DSn). Since the number of objects is greater than the number of directory servers, a hash function is used to assign object data related to a group of objects to each directory server. Thus, each object tag is assigned to the target directory server using a hash function. Preferably, the hash function distributes the object tags evenly over the available directory servers. To facilitate such mappings, preferably all the objects and the sequence of directory servers are defined by, for example, numbers, strings, and so on. A number of different mapping schemes or hash functions may be used.

Since distributing object data across multiple directory servers follows a prescribed scheme corresponding to a hash function, it is possible to use the same way of identifying a target directory server that stores object data related to a particular object tag. If the object data is not found in the target directory server due to a change to the database, the hash function includes an additional step for identifying the actual directory server storing the object data, as described with respect to the further embodiment.

If new object data is inserted into the data based on the directory server, a hash function can also be used if the data has to be relocated or the number of directory servers is changed, as will be explained in more detail below.

The system kernel K of the described embodiment preferably comprises one or more access servers AS for receiving requests for information about objects including object tags (Tl-Tw) read by a reader R -ASr). Furthermore, preferably, the one or more access servers AS1-ASr search the address (IS) IS1-ISp of the application server obtained from one or more directory servers DS (DS1-DSn) and / Retrieve data packets. 1, one or more access servers AS (AS1-ASr) are associated with a chain of requests connected to search information from the system with respect to object tags (Tl-Tw) read using a reader R .

In another embodiment, for example, a plurality of arbitrarily located access servers AS (AS1-ASr) may be provided, each serving a group of users grouped by geographic location or each serving a subgroup of a plurality of objects, respectively.

After receiving the request for information comprising the object tag T, the access server AS (AS1-ASr) identifies the directory server DS (DS1-DSn) which stores information about the application data packet associated with the object .

This preferably includes sending a request containing an object tag (Tl-Tw) to one of the directory servers DS1 (DS2; ... DSn), in turn, using a hash function and a hash table , Determines the directory server storing the object tag (T (T1-Tw)), and transmits the request to the specific directory server. However, it is also possible for other components of the access server AS1-ASr or the system kernel K to perform the steps for identifying the correct directory server.

After the identification of the correct directory server Ds (DS1-DSn), a request including the object tag (Tl-Tw) is transmitted to the identified directory server. The directory server then performs the following operations to determine all addresses of the application server (IS: IS1-ISp) which store the read application tag (Tl-Tw) and hence the application data packets associated with the object D . As will be described later, an intermediate step is also possible in which the search request is relayed to an additional device before reaching the correct directory server.

May be returned to the acquired address (IS1-ISp) and the access server (AS1-ASr) and thereafter selectively retrieving a specific application data packet from the application server where other information is identified, -ISp) and possibly other information to the user, i. E., Mobile telephone M or data processing unit DPU.

As described above, the application server provides various services related to physical objects. However, the system according to the present invention is preferably compatible with other information systems to include additional information services. The compatible system may be, for example, the Internet. In this case, the WWW information can be retrieved based on the object tag by the system according to the present invention. It is possible that the system entirely uses the storage means of an existing computer network, such as the Internet, but does not provide its own application server. The systems and methods according to the present invention are also capable of using standard and / or calibration protocols of known datacom or telecom networks to retrieve information related to objects.

2, an embodiment of a list of available directory servers DS (DS1-DSn) maintained in a hash table H is described.

As described above, after receiving the object tag (Tl-Tw) from the reader R, the access server AS (AS1-ASr) sends the request to one of the directory servers, (DS1-DSn) for storing object data related to a specific server (T).

The hash table may be stored by any component of the system kernel (K). Preferably, however, the newly available directory server and the latest hash table for keeping track of the removed directory server are always stored in one or more monitoring servers (HS1-HSt). A copy of the hash table may additionally be stored in each directory server to perform a search operation when it receives a request for the correct directory server. Moreover, a copy of the hash table may be stored in one or more access servers or mediation servers (not shown).

The copy of the hash table need not always be up-to-date. It is preferable that the copy of the hash table is only updated periodically by an updating means (not shown). Since retrieval of object data is not an important step, resources can be saved by periodically updating a copy of the hash table (H).

As described briefly with respect to Figure 1, it is desirable for one of the directory servers DS1 (DS2; ..., DSn) to identify a directory server storing information related to the requested object tag. However, other components of the system kernel K may serve as means for identifying the correct directory server.

Preferably, the hash table H comprises a plurality of entries for storing records containing the address of the application server.

In the example of FIG. 2, the hash table contains eight entries, and the address of the available server is stored as a record in each sequential entry of the hash table. Thus, the hash table constitutes a ranked list of all available directory servers, as shown in FIG. The records stored in the hash table H are represented by A, B, C, and D indicating the addresses of the four directory servers DS (DS1-DSn). However, any other ranking, e.g., D, B, A, C, is also possible.

As described above, in order to prevent an unnecessary search operation on the object tag in the directory server, the object data may be stored in the directory server according to a hash function that can be executed by the search means SM shown in Fig. The search means SM preferably groups the object tags according to the number of objects and the number of available directory servers, that is, the target directory server for storing and retrieving object data may be, for example, Is determined based on the identifier of the object tag and the number of available directory services (DS; DS1-DSn).

Object tags may be grouped and object data associated with each group of object tags may be stored in one of the plurality of directory servers using a hash function or any method. Only the method or hash function is required to store the object data related to the object in the directory server and to determine the correct directory server when receiving a request for information about the object. For example, as a storage method, all object tags and directory servers can be sequentially numbered, and object data related to object tags having sequential numbers can be stored in a directory server having sequential numbers.

In the illustrated embodiment, a hash function is used that maps object tags with sequential numbers onto directory servers with sequential numbers. Therefore, each of the directory servers DS (DS1-DSn) stores sub-groups of object tags T1-Tw sequentially numbered, and object tags having sequential numbers are stored in a directory server having a sequential number do. Therefore, the object data related to the first object tag T1 is stored in the first directory server DS1, the object data related to the second object tag T2 is stored in the second directory server DS2, The object data related to the object tag T3 is stored in the third directory server DS3 and the object data related to the fourth object tag T4 is stored in the fourth directory server DS4. Since four directory servers are available, the object data related to the fifth object tag T5 is stored again in the first directory server DS1, and similarly all the other object tags are stored in four usable directory servers .

The hash function for storing / retrieving object data in the directory server serves only as an example in which other mapping schemes can be used. For example, it is also possible that a block of object tags with a certain range of numbers can be stored in a particular directory server.

An important feature of the system is the ability to tune a large database of object data. Moreover, the system provides features suitable for varying the size of the database of object data. In particular, the system may adjust insertion of new object data or removal of obsolete object data. In addition, when the capacity of the system needs to be increased, a new directory server can be added, and the storage location of the object data can be rearranged accordingly. Similarly, the directory server can be removed. All this is accomplished by appropriately allocating a directory server for object data using a hash function and by appropriately placing the hash table (H).

Hereinafter, an example of a processing step for holding a hash table H and a database of the latest object data and a step for retrieving object data will be described with reference to FIG. 2A.

First, some retention operations are briefly described as a whole.

When a new directory server becomes available, this server can be added to the hash table H as a new record. Similarly, if one of the hash table entries becomes empty, one of the directory servers may be removed.

However, when the number of available directory servers is changed, the previously stored object data is mapped onto a number of directory servers using a hash function based on the number of previous directory servers, Based on the number of < / RTI > This will often not lead to a directory server that actually stores the object data associated with the desired object. In this case, the hash function may be designed to query the remaining directory servers according to a particular sequence until the directory server actually storing the desired object data is finally identified.

In this case, the previously stored object data is transmitted to the directory server determined based on the correct target directory server, that is, the number of the current new directory server. This transfer may be performed, for example, when the object data is found not to be located in the correct directory server on demand.

According to this process, after the number of directory servers is changed, the database of object data is incrementally updated with respect to the correct storage location of the object tag and the associated object data, i. E., Moved to each target directory server.

A newly available directory server may be inserted as a backup server to replicate one of the directory servers, in which case a portion of the database of object data is copied from the replicated server to the backup server.

The maintenance step is preferably executed by one or more monitoring servers (HS1-HSt) to always use the latest hash table.

Hereinafter, the steps of the flowchart of Fig. 2A will be described in detail.

First, the insertion of new object data corresponding to a new object tag is described.

In step S21, the system is notified to insert new object data into its own database distributed on a plurality of directory servers.

In step S22, the main directory server storing the new object data is calculated based on, for example, the number assigned to the new object tag and also based on the number of available directory servers. The step of identifying the primary directory server is preferably executed by one of the one or more monitoring servers (HS1-HSt). However, any other component of the system kernel K may identify the primary directory server. Thus, the hash function that identifies the primary directory server that stores the new object data depends on the number of available directory servers, so that the target directory server for a particular object tag can use the available directory server Gt; < / RTI >

After the target directory server for the new object data is identified using the hash function, the object data is transmitted to the target directory server and stored in step S23. This completes the sequence of steps for inserting new object data.

Hereinafter, and referring also to Fig. 2A, the steps of performing an inquiry operation on object data related to a desired object tag or object are described.

In step S24, a search request is received by the system kernel K. [ As described above, the request is generally issued by the user reading the object tag using the reader R.

Following receipt of the search request, the primary directory server for the particular object tag is determined according to the hash function in step S22. Step S22 is the same as inserting data and retrieving object data as indicated by the dashed box. After the main directory server for the object tag is determined using the hash function, a request for the object data is sent to the target directory server in step S25.

In step S26, in the main directory server, it is determined whether the object data associated with the object tag is actually located in the main directory server. As described above, this is not always so because the database is resized and the directory server can be added or removed. Therefore, when a new directory server is added after object data related to a desired object is stored in the database, the main directory server calculated in step S22 differs from the directory server, in which the object data is actually stored. This is true even if one of the directory servers is removed after the object data associated with the object tag is inserted into the database.

If the object data is located in the identified primary directory server, the object data is retrieved from the directory server in step S27 and a subsequent step is performed to provide the user with the desired information to be executed by the system kernel. As described above, this may involve retrieving application data packets from the application server based on object data or object data that is sent directly to the user, i.e., the data processing unit (DPU) and / or mobile phone M .

If it is determined in step S26 that the object data related to the object tag is not located in the identified main directory server, the search request is transmitted to another directory server in step S28. If the number of directory servers has recently been increased, the search request may be sent to a directory server determined using a hash function based on the number of previous available directory servers. This is true even if the number of directory servers has recently been reduced. If the directory does not store the desired object data, an error message is generated and the operation ends.

However, it is also possible that the search request is sent to all remaining directory servers. If the object data is not located at the desired location, after the correct directory server is identified in step S28, the object data is retrieved from the directory server and deleted from the database in step S29.

Then, the flow advances to step S23. In step S23, as described above, the retrieved object data is stored on the target directory server determined in step S22.

Figure 3 illustrates the step of retrieving application data packets associated with an object using a flowchart according to another example of the present invention. In this embodiment, a search operation is described that includes a hash function that uses a modulo operation to identify a directory server. Figure 3 also illustrates how object data can be relocated using a hash function in the event that it detects that object data is not stored in the correct directory server.

In step S31, the system kernel K receives a request from the user requesting information related to the object. The request includes at least an object tag (T; T1-Tw) of the object (D) transmitted from the reading means (R) to the system kernel. The request may also include, for example, parameters that specify the address or identifier of the user and the type of information or service required. Advantageously, said request is received by one of the access servers (AS1-ASr). However, as noted above, other components of the system may receive or process the request.

When receiving a request for information related to an object, in step S32, the number of entries in the server hash table H is assigned to the parameter a, and the number of object tags is assigned to the parameter?. In the following step S33, the modulo operation? Mod? Is executed, and the result is designated by the parameter?.

In a subsequent step S34, it is determined whether the hash table location with the number [gamma] includes a record containing the address of one of the directory servers DS (DS1-DSn), i.e. the directory server with the assigned number [gamma] Is available.

If the position? Of the server hash table is empty, the operation? =? / 2 is executed in step S35 and the flow returns to step S33. In step S33, again, β mod α is calculated to obtain a new γ. The flow again reaches step S34 if it is again determined whether the hash table location? Includes a record containing one of the directory server addresses.

The loop of steps S33, S34 and S35 is repeated until it is determined in step S35 whether the hash table position? Includes a record including the directory server address. Then, in step S36, a request including the read object tag is transmitted to the target directory server, i.e., the directory server where its own address is stored in the hash table position [gamma].

Then, in step S37, the target directory server determines whether the object data stored in itself actually includes the record including the read object tag. If such a record can not be found, the flow returns to step S33 and? Is newly calculated. The flow then continues as described above, until a directory server storing the object data is found. If the directory server does not store object data, an error message is generated.

In step S38, if the first usable directory server calculated by the above method does not include object data including a read object tag, object data relocation is executed. In this case, the object data is relocated to the first available directory server as calculated in the above manner. The relocation operation preferably includes storing object data in a "new" directory server and deleting object data in a "old" directory server.

In step S39, the directory server storing the object data determines from the object data application server address IS (IS1-ISp) storing the application data packet related to the object, and sends the retrieved address and application identifier to the access server AS1- ASr.

In step S40, each data packet is retrieved using the obtained address of the application server or the application server address is transmitted to the user.

In another embodiment, the number of locations in the hash table including the address of the directory server storing the desired object data may be obtained by calculating the number of directory servers with the number of target objects modulo. Further, this may be true to a different sequence of steps of performing the search operation, for example, the sequence of steps S39, S38 and S40.

In yet another embodiment, instead of retrieving the application data packet, additional information about the address information and the service may be transmitted, for example, to the unit initiating the request. Moreover, instead of modular operation, other mathematical operations may be used to similarly distribute object data to a plurality of directory servers DS (DS1-Dsn).

An example of the operation of inputting object data related to a new object to a database maintained in a plurality of directory servers DS (DS1-Dsn) is described below with reference to Fig. In Fig. 4, the hash function described with respect to Fig. 3 is used.

To insert the object data into the database, the latest hash table stored in one or more monitoring servers (HS1-HSt) is used.

In step S41, the system kernel K receives a request from a user or a system administrator to insert object data related to a new object into a database maintained in a plurality of directory servers.

In steps S42 to S45, similarly to Fig. 3, the number? Of directory servers storing object data is calculated. Since steps S42-S45 correspond to steps S32-S35, a description thereof will be omitted.

At step S44, it is determined whether the directory server is available at position?, And at step S46, the object data is stored in the directory server at position?.

Depending on the hash table, in step S44, the directory server is identified at the position gamma of the hash table. Thereafter, in step S47, the system kernel starts storing the object data related to the new object tag in the directory server [gamma].

Although not described, the operations may include storing each application data packet in an application server.

Similar to the previous example described with respect to FIG. 3, in another embodiment, a target directory server storing object data associated with a new object tag can be obtained by applying a hash function to a usable number of directory servers.

It should be noted that the steps described above with respect to Figures 3 and 4 provide the greatest likelihood that the object data associated with the object tag will be stored in the directory server at the location? Of the hash table. Furthermore, for example, when a new directory server is inserted, or when the old directory server is removed, the object data is appropriately relocated.

Hereinafter, with reference to Fig. 5, one embodiment of a plurality of directory servers DS (DS1-Dsn) is described.

As an example, the components of the directory server DS1 are illustrated. The directory server DS1 includes a central processing unit (CPU) for controlling the operation of the directory server. Furthermore, the tag memory means TM stores a plurality of tag data blocks TB1-TBi each comprising one or more object tags (Tl-Tw) identifying one or more objects and one or more application identifiers AIl-AIm Lt; / RTI > In addition, the tag data block may include an application server address IS (IS1-ISp) that stores application data packets corresponding to one or more application identifiers AI1-AIm.

An embodiment of the directory server DS1 shown in Fig. 5 includes an application identifier (AI1-AIm), a corresponding application server address (IS1-ISp) and optionally a corresponding object tag And address memory means (AM) for storing a plurality of address data blocks (AB1-ABk) each including one address data block (AB1-ABk). The address data block may be used, for example, to perform a garbage collection if the application data packet is removed. In this case, the address data block identifies the tag data block that stores the respective application identifier.

On the right side of Fig. 5, an example of the tag data block TBi is shown. At the first storage location of the data block, the object tag is stored and the application identifier of the application data packet associated with the object tag (Tl-Tw) is stored at the subsequent location of the tag data block. In the illustrated case, the application identifier AI10, AI12 is included in the tag data block TBi. As indicated by the dashed line, the tag data block TBi may also contain an application server address, which is the application server address IS2 taken to store the application data packet corresponding to the application identifier (AI10, AI12) Are shown.

An example of the address data block ABk is shown on the right side of FIG. In the first position of the address data block ABk, the application identifier is stored. In the illustrated case, the application identifier AIlO is stored. 5, since the application data packet having the application identifier AI10 is located at the application server having the address IS2, the application server address IS2 is stored do. In addition, as shown by the dashed line, the address data block ABi may include an object tag, of which the object tag (Tl-Tw) is shown corresponding to the application data packet AIlO .

In an alternative embodiment, the directory server may comprise a single memory means, in which case all object data associated with the object is stored in the provided memory means.

When the directory server DS1 receives a search request for a specific object, it is first determined whether the object is actually located in the directory server DS1. If the object is not located in the directory server, the request containing the object tag may be sent to another directory server. However, if a tag data block containing an object tag is stored in the directory server DS1, an operation for retrieving information about the location of the application data package associated with the object may be performed. In the embodiment of Fig. 5, when information on the object tag T (T1-Tw) is required, the directory server DS1 identifies the tag data block TBi. The tag data block TBi includes an application identifier AI10 and an application server address IS2.

If the application server address IS2 is not included in the data block, the address is determined from the address data block ABk. Many such retrieval procedures for multiple application data packets can be executed by the directory server, and the results are returned to the unit issuing the search request.

Hereinafter, an embodiment of the structure of the object tag will be briefly described. In order to be able to reference a sufficiently large number of objects, the object tag preferably contains at least 128 bits. This bit may be a code number or code that follows the ASCII code.

As an example, an example is described below in which the numbers are coded. The object tag is preferably composed of a general part and a specific part. For example, if a particular provider requires a sequence of 100,000 object tags, for example, the sequence number 5878700000-5878799999 may be reserved. In this case, the series data may be stored using identification number 5878700000. The highest digit of the object tag preferably describes the length of the general part of the object tag, and in this example is 5 digits. Retrieval of general information is performed on the object tag of this column, for example, tag 5878701234, and the object tag is identified as part of the 100,000 number sequence by the leading 5 digits. The column is then constructed by placing five final digits at zero, and the search is performed by column number 5878500000.

Although the above example shows object tags in the actual system only by ten digits, preferably a larger number is used.

Hereinafter, an embodiment of the system kernel K will be described with reference to FIG.

The system kernel of the illustrated embodiment of Figure 6 comprises any number of access servers AS1-ASr and directory servers DS1-DSn, any number of intermediary servers BS1-BSs and resource means RS1 -RSu and a monitoring server HS1-HSt. All components are connected via a network N to communicate with each other. In order to provide a robust system, all or part of the access server, mediation server, directory server, or other components of the system kernel may be replicated.

The access server AS (AS1-ASr) establishes a link between the user and the system kernel. For example, if a user desires to obtain information about a particular object, the object tag is read using the reader and sent to one of the access servers AS (AS1-ASr), preferably to an access server located nearby do. The access server can be accessed, for example, by connecting the mobile device to a network node of the mobile communication network that sends a search request to the appropriate access server. In addition to the role of receiving the object tag from the outside world, the access server AS (AS1-ASr) also preferably monitors the entire search operation of the system for retrieving and displaying information related to the object. The search operation under the control of the access server using the directory server has already been described with reference to Figs.

A mediation server (BS; BS1-BSs) is responsible for maintaining the database, resources, and other intermediaries connected to the directory. Thus, each of the mediation servers includes memory means for storing the address of the resource means and the address of another mediation server as well as storing a list of directory server addresses. When receiving a request for information related to an object, the access server may use one or more intermediary servers that perform a particular search operation with respect to the appropriate directory server address, resource means, and so on. In some cases, the mediation server may perform steps to identify a suitable one of the directory servers.

The resource means (RS1-RSu) are provided to execute a specific operation for the application data packet, for example voice representation, speech recognition and language translation services, in order to reduce the complexity of application performance.

The monitoring servers HS1 to HSt preferably maintain the latest hash tables used for insertion and / or removal of object data.

The system kernel K is preferably distributed worldwide. The components may be connected by a telecommunication network or by an existing computer network such as the Internet.

Hereinafter, another embodiment of the present invention will be described with reference to FIG. Figure 7 shows one of a number of objects D marked with an object tag T, a reading means R connected to a mobile telephone M or a data processing unit DPU, a system kernel K, IS (IS1-ISp) connected to the system kernel K over the Internet as shown.

The operation of the system according to Fig. 7 is as follows. The object tag T (T1-Tw) read by the reader R is transmitted to the system kernel K via a fixed communication line or a wireless communication link. The system kernel K performs a search operation to retrieve information about the exact location of the application data packet including information related to the object D associated with the object tag T. [ If the system kernel K successfully retrieves the address of the application server storing information, preferably information related to the object, information about the storage location is provided directly to the user, or the system kernel retrieves the information from the application server And then transmit this information to the user via the mobile telephone (M) or the data processing unit (PDU).

Figures 8-11 schematically illustrate example steps for carrying out the method according to the present invention.

First, referring to Fig. 8, an example of a step of retrieving information related to an object will be described.

In the first step S81, the mobile station M or the data processing unit DPU issues information related to the object, that is, a search request for the object tag read by the reader R. [ The search request is transmitted to the access server AS (AS1-ASr). The access server then sends the request to one of the directory servers and then identifies the correct directory server (DS; DS1-DSn) which stores the object data associated with the read object tag. However, in other embodiments, the identification of the correct directory server may also be performed by the access server. An example of the step of identifying the correct directory server has been described above with particular reference to FIG.

In a second step S82, the access server AS (AS1-ASr) requests information about information related to the object tag from one of the directory servers. The directory server may itself, for example, use a copy of the hash table to properly transmit the request to a directory server that stores object data identifying the respective storage location, i. E. The address of the application server, A search operation is performed in the database of the user. The directory server transmits the data to the access server in step S83.

Subsequently, in steps S84 and S85, the access server AS (AS1-ASr) transmits information retrieved from the directory server to the user or performs an operation of retrieving a specific application data packet from the application server. Then, at a final step S86, the access server provides data retrieved by a data processing unit (DPU) or user's mobile telephone (M) issuing a request for information.

A second example of a method according to the invention is described with reference to Fig. The example of FIG. 9 is a particularly useful system used in conjunction with a known datacom or telecom network, such as the Internet. In this case, the system according to the present invention is mainly used to execute a search of a regular internet address such as a service via an HTTP request.

In the first step S91, the user issues a search request received by the access server AS (AS1-ASr) as described with respect to Fig. 8 via the data processing unit (DPU) or the mobile telephone M. Similar to steps S82 and S83 in Fig. 8, the access server AS (AS1-ASr) starts the operation of identifying the correct directory server and retrieving the information related to the object tag which is the basis of the search request in steps S92 and S93.

In step S94, the access server can retrieve the application data packet based on the search result, and transmit the result to the data processing unit (DPU) or the mobile telephone (M). Alternatively, the access server may be used to retrieve the application data packet directly from the application server in step S95 after returning the search result directly to the data processing unit (DPU) or the mobile telephone (M). The application data packet is received in step S96. Alternatively, a regular Internet search such as a regular HTTP request may be executed in steps S95 'and S96'.

An alternative example of identifying the correct directory server will now be described with reference to FIG.

In a first step S101, similar to the previous figure, a search request for information related to an object tag is received by the access server AS (AS1-ASr).

(BS1-BSs) are used to support an access server AS (AS1-ASr) when performing a search operation to identify an accurate directory server or to perform a search of resources of the system . In step S102, the access server requests directory support from the intermediate server (BS; BS1-BSs). In step S103, the resources of the system or the address of the correct directory server are transmitted by the intermediary server, and in steps S104 and S105, the access server retrieves the object data related to the object tag similarly to the previous figure.

Alternatively, in step S103, the mediation server BS (BS1-BSs) may return the address of any other desired directory server to the access server, and then the access server sends a search request to the preferred directory server Identify the correct directory server to store the desired object data.

Another example of the step of implementing the method according to the present invention is described with reference to Fig. The embodiment of FIG. 11 is suitable for applications that require, for example, additional processing of retrieved application data packets before being sent to the user. As described above, this processing can be executed by the resource means RS (RS1-RSu) to reduce the processing load of the access server AS (AS1-ASr) or other included servers.

As in the previous example, at step S111, a search request for information associated with a particular object tag is received by the access server. Since the search of the correct directory server is the same as in the previous example, its description will be omitted. In steps S112 and S113, the access server AS1-ASr retrieves one or more application data packets from a corresponding one of the application servers, and in step S114, one or more application data packets are transmitted to the resource means RS (RS1-RSu , Which carries out a conversion on the received data and retransmits the data back to the access server in step S115.

In the final step S116, the converted data is transmitted to the data processing unit (DPU) and / or the mobile telephone (M).

Alternatively, instead of steps S113-S116, in step S113 ', as indicated by the dashed line, an application data packet may be transmitted directly from the application server to the resource means RS (RS1-RSu) The above operation is performed. Furthermore, the data may be directly transmitted to the data processing unit (DPU) or the mobile telephone (M) in step S115 'instead of steps S115 and S116.

Claims (31)

What is claimed is: 1. A system for connecting an object to information related to an object, comprising: A plurality of objects (D) each identified by an object tag (T); Each of the plurality of application data packets each having an address (IS1-ISp), each associated with an object of one of the objects and identified by an application identifier (AI1-AIm) An application server; Reading means (R) for reading one of the plurality of object tags (T); System kernel K, The system kernel includes: A plurality of directory servers (DS; DS1-DSn) each having an address and including memory means (TM; AM); Memory means for storing a list of all available directory server addresses in a hash table H; (SM) for assigning the object tag to a directory server (DS1-DSn) based on a hash function and a hash table (H), the allocation of the object tag being dependent on the number of available directory servers, The directory server storing object data associated with the assigned object tag in a distributed database, the object data associating each of the objects with the one or more application data packets; Means for receiving the read object tag (T) from the reading means (R); (DS1-DSn) for identifying the directory server (DS; DS1-DSn) assigned to the read object tag based on the hash table (H) and the hash function and searching for object data corresponding to the object tag; AS1-ASr); Means for retrieving the one or more application data packets based on the object data or transmitting at least a portion of the object data to a receiving unit (M, DPU). The method according to claim 1, Wherein object data corresponding to an object comprises an object tag, one or more application identifiers, and an address of one or more application servers storing one or more application data packets identified by the one or more application identifiers. A system that connects objects. 3. The method according to claim 1 or 2, Each of the directory servers DS (DS1-DSn) A tag memory means (TM) for storing a plurality of tag data blocks (TB1-TBi) each including one object tag of object tags (T) and one or more application identifiers (AI1-AIm); (AM) storing a plurality of address data blocks (AB1-ABk), each comprising an address of an application server storing one or more application identifiers and one or more application data packets corresponding to the one or more application identifiers And connecting the object to information related to the object. 3. The method according to claim 1 or 2, One or more monitoring servers (HS1-HSt) for inserting and removing object data from a database distributed on a plurality of directory servers using the hash function; And updates the hash table (H) when the number of usable directory servers changes. 3. The method according to claim 1 or 2, Wherein the plurality of directory servers store a copy of the hash table (H) to perform the step of identifying the directory server (DS1-DSn) storing object data related to the read object tag using a hash function And connecting the object to information related to the object. 3. The method according to claim 1 or 2, And updating means for periodically updating a copy of the hash table stored in the directory server. 3. The method according to claim 1 or 2, (BS1-BSs) comprising memory means for storing the address of the directory server, the address of the resource means (RS; RS1-RSu) and the address of the intermediary server. A system for connecting objects to related information. 3. The method according to claim 1 or 2, AS1-ASr) for coordinating communication between the plurality of application servers and the mobile telephone (M) and / or the data processing unit (DPU). . 3. The method according to claim 1 or 2, The reading means R is connected to the system kernel K for transmitting a read object tag T via a wireless communication link or a stationary communication link and connected to a mobile telephone M or a data processing unit DPU And the object is connected to information related to the object. 3. The method according to claim 1 or 2, Wherein the resource means (RS; RS1-RSu) performs data conversion on the application data packet obtained from the application server. 3. The method according to claim 1 or 2, Characterized in that the system comprises a known datacom or telecom network. 3. The method according to claim 1 or 2, Characterized in that the components of the system kernel (K) are replicated by a replication component, and each application server is replicated by a replica application server. 3. The method according to claim 1 or 2, Wherein each of the object tags (T1-Tw) comprises at least one general purpose unit and a specific unit. CLAIMS 1. A method for connecting an object to information related to an object, comprising: Displaying each of a plurality of objects with an object tag, Storing a plurality of application data packets each identified by an application identifier in memory means of a plurality of application servers, each identified by an application server address; Storing an address list of all usable directory servers DS (DS1-DSn) in the hash table H, Assigning an object tag (Tl-Tw) to a directory server DS (DS1-DSn) using a hash function and a hash table H, the allocation of the object tag being dependent on the number of available directory servers An assignment step, Storing object data corresponding to a mapped object tag in a database distributed in the directory server DS (DS1-DSn), the object data including a plurality of object data D related to a plurality of application data packets , Reading out one of the object tags of the object tags using the reading means R and sending the read object tag to the access server AS (AS1-ASr) Determining a directory server (DS1-DSn) storing object data corresponding to the object tag based on the hash table (H) and the hash function, Obtaining an address of the one or more application servers storing the one or more application data packets associated with the object based on the object data; Retrieving the one or more application data packets using the address or transmitting data corresponding to the address to the mobile telephone (M) and / or the data processing unit (DPU). A method of connecting an object to information. 15. The method of claim 14, Wherein the object data associated with the object comprises an address of the one or more application servers storing one or more object tags, one or more application identifiers, and one or more application data packets identified by the one or more application identifiers. A method of connecting an object to related information. 16. The method according to claim 14 or 15, Wherein storing the object data comprises: Storing a plurality of tag data blocks each comprising one or more object tags and one or more application identifiers; The method comprising: storing a plurality of address data blocks each comprising one or more application identifiers and an address of an application server storing one or more application data packets corresponding to the one or more application identifiers; Wherein obtaining the address comprises a search step to obtain one or more address data blocks of one or more application identifiers of a tag data block comprising a read object tag (T). . 17. The method of claim 16, Wherein the tag data block comprises an address of an application server storing an application data block associated with the object. 16. The method according to claim 14 or 15, Using a hash function when inserting and removing object data corresponding to one of the object tags from the database; Retrieving object data related to one of the object tags from a directory server of the directory servers; And rearranging object data related to one of the object tags from one directory server of the directory servers to another directory server. . 16. The method according to claim 14 or 15, Wherein the object tag and the directory server address are numbered in ascending order, the object data corresponding to the object tag having the sequential number is stored in the directory server having the sequential number; The list of directory server addresses classified by the assigned number is maintained as a hash table; Wherein the hash function and the hash table are used to identify a directory server of one of the directory servers. 20. The method of claim 19, Wherein relocating object data related to an object comprises executing a hash function when one of the directory servers is removed or an additional directory server is inserted into the hash table. A method of connecting an object to information. 16. The method according to claim 14 or 15, Wherein inserting object data related to a new object comprises assigning a number to a new object tag and executing a hash function. 16. The method according to claim 14 or 15, The hash function for identifying the directory server determines the value of the number of directory object tags by using the number of directory servers as a module or the number of hash table records divided by a multiple of 2 as a module, The method comprising the steps of: determining whether an object is associated with an object; 16. The method according to claim 14 or 15, Characterized in that the step of identifying the directory server is executed by a mediation server of one of a plurality of mediation servers (BS; BS1-BSs) arranged in a directory server of a directory server or a network. . 16. The method according to claim 14 or 15, Wherein the plurality of directory servers and / or a plurality of intermediation servers (BSs BS1-BSs) maintain a copy of the hash table, and the copy is periodically updated. 16. The method according to claim 14 or 15, The application data packet comprising an audio signal comprising data and / or information about the object or data related to the execution of the application; Characterized in that the mobile telephone or data processing unit is used for control and display or playback of information received in an application data packet. 16. The method according to claim 14 or 15, Wherein the application data packet is processed by a resource means (RS) (RS1-RSu). 16. The method according to claim 14 or 15, Wherein the application server comprises a part of a known datacom or telecommunications network. 16. The method according to claim 14 or 15, Wherein the system communicates over a known datacom or telecom network and connects a service provided by the known network. 16. The method according to claim 14 or 15, Characterized in that the components of the system kernel (K) are replicated by a backup component. delete delete

Images