CN101651715A - Compilation system - Google Patents

Compilation system Download PDF

Info

Publication number
CN101651715A
CN101651715A CN 200910142514 CN200910142514A CN101651715A CN 101651715 A CN101651715 A CN 101651715A CN 200910142514 CN200910142514 CN 200910142514 CN 200910142514 A CN200910142514 A CN 200910142514A CN 101651715 A CN101651715 A CN 101651715A
Authority
CN
China
Prior art keywords
user
number
management server
step
information
Prior art date
Application number
CN 200910142514
Other languages
Chinese (zh)
Inventor
三科达治
新垣好二
比留间裕
深泽隆茂
Original Assignee
Eath株式会社
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority to JP2003-379467 priority Critical
Priority to JP2003379466 priority
Priority to JP2003-379466 priority
Application filed by Eath株式会社 filed Critical Eath株式会社
Priority to CN200480007643.3 priority
Publication of CN101651715A publication Critical patent/CN101651715A/en

Links

Abstract

An aggregation system that can aggregate and order user operation information at high speed through a communications network. An ID number to the user is provided, and a proxy server forwards the operation information with the ID number from the user to a specific administration server based on the ID number. The administration server accesses at high speed the user information based on this ID number. In addition the prescribed server uses a special passing sequence to collect and synthesize head-count data that corresponds to score information such as the elapsed time, etc. from the start ofreception, and order information is stored in this passing sequence, and it is delivered to the administration server. Load balancers assign calls to optional proxy servers, the proxy server can relay the calls at high speed, and the administration server can reference the user information. In addition, expansion is easy since the processing is done by dispersal by means of a plurality of administration servers.

Description

合计系统 Total system

本申请是分案申请,原案申请的申请号为2004800076433,国际申请号为PCT/JP2004/016109,申请日为2004年10月29日,发明名称为"合计系统"。 This application is a divisional application, application number original bill filed 2004800076433, International Application No. PCT / JP2004 / 016109, filed October 29, 2004, entitled "Total system."

技术领域 FIELD

本发明涉及合计系统,尤其涉及能够通过因特网等通信网高速地对多个利用者在短时间内操作的信息进行合计并赋予序号的合计系统。 The present invention relates to a total system, in particular, it relates to a plurality of user operations in a short time by the information communication network such as the Internet at high speed and giving the total number of the total system.

背景技术 Background technique

以往,提出有用于与观众参与的电视节目联动,将观众(利用者) 操作的投票信息等进行合计反映给节目的系统。 Conventionally, there is a linkage with audience participation television programs, the audience (user) and other voting information operations totals to reflect the program's system. 例如,在下述专利文献l 中,公开了由WW服务器经由因特网收集观众的投票信息的系统。 For example, in the following Patent Document l discloses a voting system for collecting information of the viewer by WW server via the Internet.

专利文献1特开2002—344928号公报 Patent Document 1 Laid-Open Patent Publication No. 2002-344928

上述现有的WWW服务器系统例如由加载平衡器、http服务器、RDB (关系型数据库)服务器等构成。 The above-described conventional systems such as WWW server, http server, RDB (relational database) server by a load balancer or the like. 可是,在这些装置中,针对高速化存在着如下的问题。 However, in these devices, there is a high speed for the following problems.

在第7层加载平衡器(具备会话管理功能)中,由于需要对用于将同一利用者转送到同一http服务器的应用协议进行解读,和进行一边检索所保持的过去的信息一边进行确定http服务器的处理,所以在速度上存在限制。 In the seventh layer load balancer (includes session management), since the need for interpretation of application protocols for the same user is transferred to the same http server, and retrieving information while held in the past determined http server side process, there is a limitation on the speed. 另外,也存在着由于根据保存的利用者信息进行负荷分散, 所以不能进行按比例的增设的问题。 Further, there are as a result of load distribution based on the stored user information, the problem can not be performed in the additional scale.

基于http服务器(具备会话管理功能、表高速缓冲功能)的并列配备的性能的界限依赖于RDB (关系型数据库)。 Http-based server (includes a session management function, the cache table functions) in parallel with the marginal performance depends on a RDB (relational database). 并且存在着如果同一利用者不在同一hUp服务器进行处理,就不能与并列的其他的http服务器保持一致性的问题。 And if there were not in the same hUp use the same server for processing, it can not maintain consistency with other issues http server side by side. 这是由于为了不给RDB服务器增加负担而进行了高速缓存。 This is because in order not to increase the burden carried RDB server cache.

RDB服务器不能在RDB以上与成本成比例地增强性能,即使使用价格非常高的系统,也存在着不能对应集中的访问的问题。 RDB server can not proportionally enhance the performance and cost in the RDB above, even if a very expensive system, but also there is a problem can not be accessed by the corresponding set.

另外,在上述的现有系统中,例如在需要根据利用者已发送的对问答题的回答的操作信息,按照利用者发送正确操作的先后顺序来赋予序号的情况下,在WWW服务器中对全部利用者信息进行赋予序号的处理。 In the case where the above-described conventional system, such as where, in accordance with the transmission sequence of the correct operation of the user based on operation information of the answer to the quiz has been sent to the user of the given sequence number, for all the WWW servers the user information is processed in the given sequence number. 但在为了使处理高速化而设置了多台WWW服务器的情况下,为了进行序号赋予处理,需要将利用者的操作信息收集到1台服务器中,进行赋予序号处理,并将结果分配到多台WW服务器中。 In the case of high-speed processing and to set up a plurality of WWW servers in order to perform serial-imparting treatment, it is necessary to collect the operation information of the user to a single server, for the given sequence number processing, and assign the result to multiple WW server.

可是,在从各个WWW服务器仅收集全部利用者信息,或分配赋予序号的结果数据时,要转送的数据量变大,并且综合收集的数据赋予序号的处理,或者在各WWW服务器中进行在利用者数据中反映序号信息的处理的负荷变大,因此存在着在得出结果之前耗费时间的问题。 However, when the results of the data collected from each WWW server only all user information, or assign the given sequence number, to transfer data becomes large, and the data integrated collection imparting process numbers, or in the user in the WWW server reflecting the load of processing data and a sequence number becomes large, there is a problem takes time before the result.

发明内容 SUMMARY

本发明的目的就是要解决上述的现有的问题。 Object of the present invention is to solve the conventional problems described above.

本发明的最主要的特征为,给利用者分配特殊的ID号,使来自利用者的操作信息包含该ID号。 The main feature of the present invention is, to assign special user ID number, the operator information from the user including the ID number. 并且,通过被任意地分配给呼叫的利用者代理服务器进行基于该ID号的计算来指定利用者管理服务器,高速地连接到特定的利用者管理服务器。 And, for the user to specify the ID management server based on the calculated number, connected to a particular high speed user management server by being arbitrarily assigned to a call by using a proxy server. 另外的特征是,在利用者管理服务器,不是根据该ID号进行费时的检索而是通过计算对所记录的利用者信息进行高速的访问,根据操作信息更新利用者数据。 Further characterized in that, in the user management server is not time-consuming to retrieve the basis of the ID number, but high-speed access to the user information recorded by calculating, based on the operation data of the user information update.

另外,另一特征是,将由多个利用者管理服务器算出的与每个利用者的信息,例如从受理开始的经过时间等得分信息对应的人数数据存储成为特殊的交接数组数据。 Further, another feature is calculated by a plurality of user information management server to each user, for example, be a special array data transfer time elapsed from the reception of the start point information corresponding to the number of data storage. 并且,其他特征是,通过将交接数组数据收集到规定的号码赋予服务器,进行加法合成在系统整体求出与得分信息对应的人数。 And, wherein the other, imparted by the server transfer the collected data to a predetermined number of the array, the number of additively combining information corresponding to the score obtained in the overall system. 另外,交接数组数据能够以一定的规则进行分割,在已分割的情况下可以在多个服务器进行加法合成,能够提高性能。 Further, the array of data transfer can be split to certain rules, may additively combining the plurality of servers in the case of the segmented, performance can be improved. 还有将加法合成后的交接数组数据的人数转换为序号的特征。 There will be the number of transfer data array is converted to the number of additive synthesis feature. 根据本发明的构成例如达到如下的效果。 The configuration of the present invention, for example, to achieve the following effects. 根据本发明的构成,由于在加载平衡器不需要将同一利用者转送到同一利用者代理服务器,所以 The configuration of the present invention, it is unnecessary to transfer the same to the user in the same user load balancer proxy server,

能够将数据包在第3层的水平上按照到达顺序分配给任意的利用者代理服务器,由于不需要为了分散而进行的信息存储和应用协议的解读、判定,所以能够进行高速处理且能进行任意的增设。 The packet can be at the level of the third layer in accordance with the order of arrival assigned to any user of a proxy server, as information storage and interpretation of application protocols do not need to be dispersed, the determination, it is possible to perform high-speed processing and can be arbitrarily the additional.

由于利用者代理服务器能够将利用者的ID除以利用者管理服务器数,利用其余数来指定存储有利用者信息的利用者管理服务器,所以不必进行检索,能够高速地进行信息的中继转送。 Since the proxy server the user ID of the user can be divided by the number of the user management server, using the remaining number to specify the user management server stores user information, it is not necessary to retrieve, information can be transferred at high speed relay. 利用者管理服务器在以利用者的ID除以利用者管理服务器数的商为索引的数组的位置上存储有利用者的信息,所以可以不必进行检索,高速地进行利用者信息的参照和重写。 In the user management server to the user ID of the user managed by dividing the quotient of the number of servers for the indexed array position stored information of the user, it may not be necessary to retrieve, high speed and with reference to the user information rewriting .

另外,根据本发明的构成,在由多个利用者管理服务器进行分散处理的利用者信息数据的收集/分配中使用特殊的交接数组数据。 Further, according to the configuration of the present invention, using a special transfer array data acquisition / distribution by a plurality of the user management server distributed processing user information data. 该交接数组数据由于仅由与存在数据的得分信息对应的人数数据的单元构成,所以可减少在服务器之间转送的数据量,縮短处理/转送时间。 Since only the array data transfer unit by the number of the score data corresponding to the presence information data configuration, it is possible to reduce the amount of data transferred between the server, to shorten the processing / transfer time.

另外,通过多个利用者管理服务器同时生成交接数组数据,并且还通过多个利用者管理服务器同时分散处理从被发布的数组向利用者信息赋予序号信息的处理,所以能够实现处理的高速化。 Further, by generating a plurality of management servers simultaneously transfer the user data array, and further processing the dispersion while the given sequence number information from the array is released to the user by a plurality of user information management server, it is possible to achieve high-speed processing. 而且,对于多个交接数组的合成处理也能够通过多个利用者管理服务器同时进行分散处理。 Further, a plurality of the transfer process for the synthesis of arrays of dispersion treatment can be performed simultaneously by a plurality of user management server. 由此,可以不必将分散于多个利用者管理服务器的利用者数据集中在一个地方进行排序处理,从而能高速地求出序号。 Thereby, the user does not have to be dispersed in a plurality of user data management server in a centralized place sorting processing, which can obtain a high speed serial number.

另外,在本发明的构成中,利用者管理服务器为了进行最大限度的高速动作,将利用者信息和操作信息等存储在存储器中。 Further, in the configuration of the present invention, the user management server in order to maximize high-speed operation of the user information and operation information stored in the memory. 通过使用RDB 等存储方法,能够得到这样的效果:可以展开既能够确保与需要持续性的已有的WWW/RDB系统等相同的功能和安全性,又能够容易地增加处理能力的系统。 By using RDB and other storage method, you can get this effect: You can expand the same functionality and safety with the need both to ensure continuity of existing WWW / RDB systems, and can easily increase system capacity.

因此,本发明的系统具有这样的效果:即使在短时间内有大量呼叫集中,也能够高速地进行应答处理和通过序号赋予的优劣处理等的合计, 并且通过根据需要增加利用者管理服务器等,可容易地增加处理能力。 Thus, the system of the present invention has an effect: even if a large number of calls concentrate in a short time, it is possible to perform high-speed processing and the response by the total number of merits imparting treatment, and by increasing the user management server as needed, etc. It can be easily increased processing power. 附图说明 BRIEF DESCRIPTION

图1是表示本发明的实施例的系统整体的结构的方框图。 FIG. 1 is a block diagram of the system according to the present embodiment of the invention as a whole.

图2是表示本发明的合计节点11〜13的结构的方框图。 FIG 2 is a block diagram showing a configuration of the aggregate node of the invention is 11~13.

图3是表示本发明的管理、登录节点的结构的方框图。 FIG 3 is a block diagram of the management of the present invention, the node login.

图4是表示本发明的各装置间的处理的交换的流程图1。 FIG 4 is a flowchart of a switching process between devices according to the present invention.

图5是表示本发明的各装置间的处理的交换的流程图2。 FIG 5 is a diagram showing a process of switching between the respective devices of the invention Scheme 2.

图6是表示本发明的操作信息的登录处理的详细情况的流程图。 FIG 6 is a flowchart showing details of the operation information of the registration process of the present invention.

图7是表示本发明的交接数组的数据结构的说明图。 FIG 7 is a diagram illustrating a data structure of the transfer array of the present invention.

图8是表示本发明的合计/序号赋予处理的详细情况的流程图。 FIG 8 is a flowchart showing details of the sum / number imparting process of the present invention.

图9是表示操作信息的登录处理的例子的说明图1。 FIG 9 is a diagram illustrating an example of operation information registration processing of FIG.

图10是表示操作信息的登录处理的例子的说明图2。 FIG 10 is a diagram illustrating an example of operation information registration processing in Fig.

图11是表示操作信息的登录处理的例子的说明图3。 FIG 11 is a diagram illustrating an example of operation information registration processing in Fig. 图12是表示操作信息的登录处理的例子的说明图4。 FIG 12 is a diagram illustrating an example of operation information registration processing in Fig. 图13是表示图8的步骤S40的处理例的说明图1。 FIG 13 is a chart showing an example of step S40 of FIG. 8 1. 图14是表示图8的步骤S41〜步骤S45的处理例的说明图1。 FIG 14 is a diagram illustrating an example of the processing in step S45 S41~ step 1 of FIG. 8. 图15是表示图8的步骤S40的处理例的说明图2。 FIG 15 is a chart showing an example of step S40 of FIG. 2. 图16是表示图8的步骤S41〜步骤S45的处理例的说明图2。 FIG 16 shows a step in FIG. 8 S41~ explaining the processing step S45 of the embodiment 2. 图17是表示图8的步骤S50、步骤S51的处理例的说明图。 FIG 17 is a diagram of FIG. 8 step S50, step S51 described processing example of FIG. 图18是表示图8的步骤S52、步骤S53的处理例的说明图1。 FIG 18 is a diagram illustrating an example of the processing steps of FIG. 8 S52, step S53 is 1. 图19是表示图8的步骤S52、步骤S53的处理例的说明图2。 FIG 19 is a chart showing an example of the step of FIG. 8 S52, step S53 is 2. 图20是表示图8的步骤S55〜步骤S59的处理例的说明图1。 FIG 20 is a chart showing an example of the step of FIG. 8, step S59 S55~ 1. 图21是表示图8的步骤S55〜步骤S59的处理例的说明图2。 FIG 21 is a chart showing an example of step S59 of FIG. 8 S55~ Step 2. 图22是表示图8的步骤S55〜步骤S59的处理例的说明图3。 FIG 22 is a chart showing an example of step S59 of FIG. 8 S55~ step 3. 图23是表示图8的步骤S55〜步骤S59的处理例的说明图4。 FIG 23 is a chart showing an example of step S59 of FIG. 8 S55~ step 4. 图24是表示图8的步骤S55〜步骤S59的处理例的说明图5。 FIG 24 is a chart showing an example of step S59 of FIG. 8 S55~ step 5. 图25是表示图8的步骤S55〜步骤S59的处理例的说明图6。 FIG 25 is a chart showing an example of the step of FIG. 8, step S59 S55~ 6. 图26是表示图8的步骤S55〜步骤S59的处理例的说明图7。 FIG 26 is a diagram illustrating an example of the processing steps of step S59 of FIG. 8 S55~ 7. 图27是表示图8的步骤S55〜步骤S59的处理例的说明图8。 FIG 27 is a diagram illustrating an example of the processing steps of step S59 of FIG. 8 S55~ 8. 图28是表示图8的步骤S70的处理例的说明图。 FIG 28 is a chart showing an example of step S70 of FIG. 8.

图29是表示图8的步骤S71的处理例的说明图。 FIG 29 is a chart showing an example of step S71 of FIG. 8.

图30是表示图8的步骤S72的处理例的说明图。 FIG 30 is a diagram illustrating an example of the processing in step S72 of FIG. 8.

图31是表示序号赋予处理已结束的状态的说明图。 FIG 31 is a diagram illustrating the processing has been completed are sequentially assigned to a state.

图32是表示本发明的第二实施例的各装置间的交换的流程图。 FIG 32 is a flowchart of the exchange among devices of the second embodiment of the present invention.

图33是表示本发明的第二实施例的合计/序号赋予处理的说明图。 FIG 33 is a diagram illustrating the sum / number of the second embodiment of the present invention imparts processing.

图34是表示本发明的第二实施例的序号赋予处理的流程图。 FIG 34 is a flowchart showing a second embodiment of the serial number given to the present invention process.

图35是表示本发明的第二实施例的数组生成处理的流程图。 FIG 35 is a flowchart showing a second embodiment of an array of the present invention, the generation process.

图36是表示本发明的第二实施例的序号转换处理的流程图。 FIG 36 is a flowchart showing a second embodiment of the number conversion process of the present invention.

图37是表示第二实施例的下位阶层子程序的流程图。 FIG 37 is a flowchart showing a subroutine of the lower strata of the second embodiment.

图38是表示本发明的第二实施例的序号赋予处理的流程图。 FIG 38 is a flowchart showing a second embodiment of the present invention No. imparting treatment.

图中:10:登录节点;11〜13:合计节点;14:管理节点;15:演播室终端;16: DNS; 20:电视台;21:专用网络;22:因特网;25、 28: 移动体通信网;30:移动终端(移动电话机);31:电视。 FIG: 10: Log node; 11~13: Total nodes; 14: management node; 15: Terminal studio; 16: DNS; 20: television; 21: private network; 22: Internet; 25, 28: mobile communication network; 30: the mobile terminal (mobile telephone); 31: TV.

具体实施方式 Detailed ways

以下,对能够通过因特网高速地对与电视节目联动的利用者操作信息进行合计并赋予序号的序号赋予系统进行说明。 Hereinafter, the serial number of the user is capable of operating in conjunction with television programming information via the Internet at high speed and the total number of imparting to impart the system will be described. 实施例1 Example 1

图1是表示本发明的实施例的系统整体的结构的方框图。 FIG. 1 is a block diagram of the system according to the present embodiment of the invention as a whole. 因特网22 通过网关23、 24与多个移动体通讯网A25、 B26连接,移动终端30可以通过基站26、 29与因特网连接。 Internet 22 through a gateway 23, communication network 24 with a plurality of moving bodies A25, B26 is connected, the mobile terminal 30 can be connected to the Internet via the base station 29 26. 因特网还与DNS (域名服务器)16和PC 终端33连接。 33 is also connected to the Internet DNS (Domain Name Server) 16 and the PC terminal. 而且,这样的结构是公知的。 Moreover, such structures are well known. 利用者(观众) 一边利用电视机31收视来自电视台20的电视节目, 一边使用移动终端30访问本发明的合计系统。 User (viewer) side from viewing on the television 31, the television program 20, while the sum of the present invention using the access system of the mobile terminal 30.

在因特网22上,连接有本发明的登录节点IO、三个合计节点All、 B12、 C13。 On the Internet 22 connected to the IO node of the invention login, total three nodes All, B12, C13. 这些节点也连接到专用网络(以下记为PN) 21。 These nodes are also connected to a private network (hereinafter referred to as PN) 21. 在PN21上还连接有本发明的管理节点14、演播室终端15。 On PN21 also be connected to the management node 14 according to the present invention, the terminal 15 studio. PN21既可以由专用线路等构成,也可以在因特网22内设置VPN (虚拟专用网络)。 PN21 may be constituted by a dedicated line or the like, may also be provided a VPN (Virtual Private Network) 22 in the Internet. 也可以不设置PN21,将全部装置经由因特网连接。 May not be provided PN21, all the devices connected via the Internet.

虽然合计节点最少有一个即可,但通过如图所示进行分散配置来分散呼叫,使得即使连接到一个地方的合计节点的线路阻塞或者出故障, 也可以利用其他的合计节点的数据来继续进行节目。 Although a minimum total node can, but by the configuration shown in FIG dispersion to disperse a call, so that even if connected to a node where the sum of the line is congested or fails, the other data may be utilized to continue the aggregate node program.

图2是表示本发明的合计节点11〜13的结构的方框图。 FIG 2 is a block diagram showing a configuration of the aggregate node of the invention is 11~13. 在通过路由器40、 UN45与因特网22连接的多个加载平衡器41上,设定有各不相同的IP地址,通过公知的DNS (域名服务器)16的作用,使呼叫(访问) 分散到来。 In the router 40, UN45 22 is connected to the Internet on a plurality of load balancers 41, are set for each different IP address, 16 by the action of a known DNS (domain name server) that call (access) dispersed soon. 各个加载平衡器41按照序号选择多个利用者代理服务器42 中的一个,按照呼叫到来的顺序转送呼叫。 Load balancer 41 according to the respective number selecting one of the plurality of user agent server 42, the transfer order of call incoming call.

通过LAN46与加载平衡器41连接的利用者代理服务器42,进行后述的处理,进行格式转换、利用者管理服务器43的确定以及呼叫的转送和应答。 42, processing described later is performed by the user with a proxy server load balancer 41 LAN46 connected, format conversion, the user management server 43 to determine the routing and the call and response. 通过LAN46与利用者代理服务器42连接的利用者管理服务器43, 进行后述的处理,进行由利用者发送的操作信息等的记录和保持、合计信息的输出、序号信息的登录等。 43, the process will be described later by the user LAN46 proxy server 42 connected to the user management server, recording operation information transmitted by the user and the like to maintain a total output of information, entry number information and the like. 并且,在本发明中使用的各种服务器可以通过在市面上销售的服务器装置中作成、安装后述的本发明的程序来实现。 Further, the various servers used in the present invention, the server apparatus may be sold in the market by the creation, after the installation program of the present invention described below is achieved.

图3是表示本发明的管理、登录节点的结构的方框图。 FIG 3 is a block diagram of the management of the present invention, the node login. 图3 (a)是表示管理节点14的结构的方框图。 FIG. 3 (a) is a block diagram of the configuration of a management node 14 expressed. 在管理节点14上,设有管理系统整体的处理状态的状态管理服务器51,接收来自合计节点的利用者管理服务器43的合计数据并赋予序号的序号赋予服务器53,从利用者管理服务器43接收特定(例如上位等)的序号数据、生成节目所必需的名次表的名次表综合服务器52。 14 on the management node, with the overall processing state management system state management server 51, the user management server receives from the sum total of the data node 43 and gives the serial number given to the server 53, to receive a particular management server 43 from the user (e.g., upper, etc.) number of data necessary for generating a program table ranking server 52 integrated ranking table. 图3 (b)是表示登录节点10的结构的方框图, 设置有登录服务器。 FIG 3 (b) is a block diagram of the login node 10 is provided with a login server. 另外,也可以将管理节点、登录节点、合计节点综合起来设置在一个地方。 In addition, you can also manage nodes, login nodes, the nodes together total set in one place.

图4是表示本发明的各装置间的处理的交换的流程图1。 FIG 4 is a flowchart of a switching process between devices according to the present invention. 该流程图表示登录处理和参加准备处理。 This flowchart shows the login process and participate in the preparation process. 利用者起动终端30的浏览器访问登录服务器61 (步骤S1)。 Starter browser user terminal 30 access the login server 61 (step S1). 登录服务器61返送登录页(步骤S2),并显示于终端(步骤S3)上。 Log foldback login page server 61 (step S2), and displayed on the terminal (step S3). 利用者输入姓名和住所等个人信息(步骤S4)。 Enter the user name and address and other personal information (step S4).

登录服务器61当接收到个人信息时,对成为关键字的字符串(住所、姓名、年龄和从移动通信网得到的唯一的利用者识别码等)的散列码(被无规律地分散的值)进行除法运算,选出应该存储的合计节点。 When the login server 61 receives the personal information to a string of (address, name, age, and unique user identification code obtained from the mobile communication network, etc.) of the hash keys is (are irregularly dispersed value ) for division, to be stored in the node selected total. 字符串的散列码h例如用下面的方法进行计算: H hash code string for example calculated using the following method:

h = s[O] * 31一(nl) + s[l] * (n-2) +…+ s[n-1] 在这里,s[i]表示字符串的第i个字符码,n是字符串的长度, " 表示求幂。而且,如果相同的字符串被分配了相同的数字(码),则也可以是被有意识地分散的值(例如针对北海道的利用者使北海道的合计节点被选择)。 h = s [O] * 31 a (nl) + s [l] * (n-2) + ... + s [n-1] Here, s [i] denotes the i-th character code string, n is is the length of the string, "represents exponentiation. Further, if the same character string is assigned the same numbers (codes), it may be intentionally dispersion value (e.g., so that the total node for Hokkaido Hokkaido user be chosen).

然后,根据将该散列值除以要连接的合计节点内的利用者管理服务器数后的余数来指定利用者管理服务器序号。 Then, the management server specifies the user ID in accordance with the remainder after the user node in the hash value is divided by the total to be connected to the management server number. 该处理用于确保使相同的利用者连接到相同的利用者管理服务器,从而不能进行多次的登录,并且使呼叫均等地分配到多个利用者管理服务器上。 The same process is used to ensure that the user is connected to the same user management server, and thus can not log in multiple times, and the call is uniformly distributed to the plurality of user management server. 登录服务器61向所选择的利用者管理服务器43转送登录信息(步骤S5)。 Log server 61 transfers the log information to the selected user management server 43 (Step S5).

接收了登录信息的利用者管理服务器43,根据登录利用者信息的数组的新数组位置I (例如如果已有0、 l的两个利用者登录,则1=2),和利用者管理服务器数N (例如设N-3)、自身的利用者管理服务器序号M (例如设M-1)生成"ID号"。 Receiving the user login information management server 43, according to the new position of the array of array I login user information (e.g. if already 0, l two user logged on, 1 = 2), and the number of the user management server N (provided, for example N-3), its own user ID the management server M (e.g. provided M-1) generates "ID number." 生成式是ID=IXN+M,在上述例中ID=2 X3 + l = 7。 Formula is ID = IXN + M, in the above embodiments ID = 2 X3 + l = 7. 利用者管理服务器43在登录利用者信息的数组的新的数组位置I上登录个人信息等,将生成的ID号通知给登录服务器61 (步骤 User login management server 43 such as personal information on the new position of the array of array I login user information, the generated ID number is notified to the login server 61 (step

56) 。 56).

登录服务器61将包含了接收到的ID号的参加页发送给终端(步骤 Log server 61 including the ID number of the received page to the participation of the terminal (step

57) 。 57). 在该参加页上记载有所选择出的合计节点的地址和ID号,利用者只要在参加页上进行参加操作,包含有ID的参加信息就被发送给所选择的合计节点(步骤S8)。 Described in the page address and participate in the total number of node ID has been selected, as long as the user to participate in operation on the page to participate, with the participation ID information is sent to the selected node sum (step S8).

在合计节点中,加载平衡器按照呼叫的到达顺序将呼叫转送给任意的利用者代理服务器(步骤S9),利用者代理服务器42只要接收到参加信息,就发送包含有ID号的操作页(步骤SIO),并显示于终端(步骤Sll)。 In sum node, the load balancer order of arrival of the call to the call forwarding any user proxy server (Step S9), as long as the user proxy server 42 receives the participation information is sent with the ID number of the page operation (step SIO), and is displayed on the terminal (step Sll). 由此结束参加准备。 Thus ending participate in the preparation.

图5是表示本发明的各装置间的处理的交换的流程图2。 FIG 5 is a diagram showing a process of switching between the respective devices of the invention Scheme 2. 该流程图表示与节目关联的问答题和民意测验的回答的一次合计处理,实际上在 This flowchart shows the total processing time associated with the program quizzes and polls to answer, in fact,

节目中重复多次该处理。 The process is repeated several times in the program. 首先,状态管理服务器51根据来自演播室终端15的指示,指示"准备"状态(步骤S24)。 First, the status management server 51 according to an instruction from the terminal 15 of the studio, indicating "ready" state (step S24). 在"准备"状态下,即使操作终端来发送操作信息,在利用者代理服务器也仅返送相同的操作页、 而不进行任何处理的状态。 In the "ready" state, even if the operator terminal transmits the operation information, the user is only a proxy server send back the same page operation, a state without any processing.

然后,状态管理服务器51根据来自演播室终端15的回答受理开始指示,指示"收集"状态(步骤S25)。 Then, state management server 51 receives a reply from the studio start instruction according to the terminal 15, indicating "collecting" state (step S25). 在"收集"状态,利用者一操作终端发送操作信息,就连接到指定的合计节点,加载平衡器按照呼叫到达的顺序向任意的利用者代理服务器转送呼叫(步骤S13)。 In the "collecting" state, the user terminal sends the operation information of an operation, even to the specified sum nodes, load balancer forwarding the call (step S13) in an arbitrary order the user proxy call arrival.

在利用者代理服务器42中,统一因不同的利用者的终端而各不相同的数据格式,根据将包含于接收到的操作信息中的ID号除以节点内的利用者管理服务器数后的余数,求出利用者管理服务器号,并向该利用者管理服务器转送操作信息(步骤S14)。 In the user proxy server 42, unified by a terminal different from the user of the different data formats, according to the remainder after the user in the operation information included in the received ID number is divided by the node management number of servers , the management server obtains the user number, and the user management server transfers the operation information (step S14). 利用者管理服务器43,根据将接收到的操作信息的ID号除以节点内的利用者管理服务器数所得的商,求出数组位置,记录利用者信息(步骤S15)。 The user management server 43, in accordance with the obtained node ID number by the received user operation information management server quotient, the array element location, recording the user information (step S15).

例如如果商=2,则在数组的第二个利用者数据上一起记录利用者所按压的按钮的信息等操作信息和时间信息(从收集开始起的以毫秒为单位的经过时间)。 For example, if supplier = 2, then the recording operation together with the time information and other information and the user presses the button (collected from the start of milliseconds elapsed time) on the second user's data array. 并且,通过把该数组数据预先配置在存储器上能够使处理更加高速化。 And, by the pre-configured array data on the memory the process can be further accelerated.

信息的记录一结束,利用者管理服务器43就通知利用者代理服务器,利用者代理服务器42向终端发送操作页(步骤S16)。 One end of information recording, the user management server 43 notifies the user proxy server, the proxy server 42 transmits the user operating the page (step S16) to the terminal. 在终端再次显示操作页(步骤S17)。 Page display operation (step S17) again in the terminal. 并且,在利用者在收集期间内进行了多次操作的情况下,既可以改写操作信息等,也可以忽略第二次及之后的操作信息。 Further, in a case where the user performed a plurality of times of operations, the operation information may be rewritten, after the operation information can be ignored and the second collection period.

然后,状态管理服务器51根据来自演播室终端15的合计(受理结束)指示,指示"合计"状态(步骤S26)。 Then, state management server 51 (acceptance end) indicating the terminal according to the studio from a total of 15, indicating "total" state (step S26). 在"合计"状态,即使从终端发送操作信息在利用者代理服务器也仅返送相同的操作页,而不进行任何理。 In the "total" state, even if the operation information transmitted from the user terminal in the proxy server can send back the same operation only page, without any treatment. 利用者管理服务器43例如根据利用者的操作信息和时间信息设定得分,根据利用者信息数组生成图7所示的交接数组数据并发送给规定的序号赋予服务器53 (步骤S18)。 For example, the user management server 43 based on the operation information and the time information setting user's score, and sends a predetermined number array data transfer according to the given server 7 shown in FIG generates user information array 53 (step S18). 序号赋予服务器53从多个利用者管理服务器收集数组数据,利用后述的方法将得分转换为名次,将名次信息再次发送给利用者管理服务器43 (步骤S19)。 53 are sequentially assigned to the server from a plurality of user data management server collects the array, the method described later is converted to a score ranking, the ranking information is again sent to the user management server 43 (step S19). 另外,虽然在图3中记载有多个序号赋予服务器53,但这是为了分散进行综合得分和各提问的得分等多个序号赋予处理, 一个序号赋予处理必须通过一台序号赋予服务器进行。 Further, although described in FIG. 3 are sequentially assigned to a plurality of servers 53, this is for a plurality of decentralized number composite score and the score of each question imparting treatment, etc., a process must be sequentially assigned a serial number given by the server. 利用者管理服务器43 根据所发送的名次信息,在赋予利用者名次的同时,将例如前10名的个人信息等预先确定的范围的信息发送给名次综合服务器52 (步骤S20)。 The user management server 43 according to the ranking information transmitted, at the same time gives the user ranking, for example, 10 transmission information before personal information or the like to a predetermined range of the integrated ranking server 52 (step S20). 名次综合服务器52根据从多个利用者管理服务器43接收到的信息综合(合成)名次表,发送到演播室终端和外部的Web服务器功能等进行公开。 Integrated ranking server 52 (Synthesis) league table based on the information received from the plurality of integrated management server 43 to the user, and transmits to the studio terminal and an external Web server function or the like is disclosed. 另外,向状态管理服务器51通知序号赋予结束。 Further, the notification sequence number given to the state management server 51 ends. (步骤S21) (Step S21)

根据如上的构成和处理,即使在短时间内呼叫集中,也能够不产生迟延和错误动作地高速地进行合计和序号赋予。 According to the above configuration and processing, even in a short time a call set, it is possible to delay and malfunction is not generated at high speed and the total performed sequentially assigned. 并且,虽然在图5中, 举出了在"收集"过程中不进行合计的例子,但全部利用者管理服务器43也可以在收集过程中例如以一秒间隔的周期或者非周期地进行步骤S18的处理,由此进行中间合计。 Further, although in FIG. 5, not cited in the examples total "collection" process, but all of the user management server 43 may be, for example, at periodic intervals of one second or aperiodically step S18 during collection process, whereby the intermediate sum. 通过中间合计可以几乎实时地判明排名靠前的利用者信息和到当前为止的回答者数等。 By the middle of almost real-time ascertain the total top-ranked and user information such as the number of respondents to the current date.

下面,对操作信息的合计/名次赋予处理进行更详细的说明。 Next, the aggregate / rank given to the operation information processing explained in more detail. 图6是表示本发明的操作信息的登录处理的详细情况的流程图。 FIG 6 is a flowchart showing details of the operation information of the registration process of the present invention. 另外,图9〜图12是表示操作信息的收集处理的例子的说明图。 Further, FIG. 9~ FIG. 12 is a diagram illustrating an example of the operation of the information collection process. 并且,在图9〜12的例子中,配置有索引为0、 1、 2的3台利用者管理服务器(-利用者管理员),例如设在索引1的服务器上在利用者信息数组中登录有数组索引为0、 1、 2的3个利用者。 Further, in the example of FIG 9~12 arranged to index the user management server 3 sets 0, 1, 2 (- administrator user), for example, an index provided on the server registered in the user information array array with three user index 0, 1, 2.

在图6中,在步骤S13,加载平衡器按照呼叫到达顺序向任意的利用者代理服务器转送呼叫。 In FIG. 6, at step S13, the load balancer forwarding calls according to the call arrival order to an arbitrary user agent server. 利用者代理服务器在步骤S30将输入的数据转换/统一为利用者管理服务器形式。 Proxy user input in step S30, the data conversion / unified form to the user management server. 这是由于每个终端的数据格式都不同所以是必须的。 This is because the data format is different so that each terminal is required.

利用者代理服务器42,在步骤S31,根据将包含于接收到的操作信息中的ID号除以利用者管理服务器数后的余数,求出利用者管理服务器号,并向该利用者管理服务器转送操作信息。 By using a proxy server 42, at step S31, the operation of the information to be included in the received ID number is divided by the number of the user management server, the management server obtains the user number, and forwards the user management server operational information. 例如如果ID号是7,利用者管理服务器数N二3,则利用者管理服务器号M是7 + 3的余数-l。 If the ID number is 7, for example, the user management server number N = 3, the number of the user management server M is the remainder of -l 7 + 3. 在步骤S32向索引与余数一致的利用者管理服务器输出利用者的操作信息(图11)。 In step S32, the operation information is consistent with the number of index I user management server of the user output (FIG. 11).

利用者管理服务器43,在步骤S33,根据将接收到的操作信息的ID 号除以利用者管理服务器数后的商,求出数组位置(数组索引)。 The user management server 43, at step S33, the ID number in accordance with the received operation information is divided by the number of the user management server, obtains the position of the array (array index). 在步骤S34记录接收到的利用者的操作信息。 User operation information received is recorded in step S34. 例如如果商=2,在数组索引为第二的利用者数据上一起记录利用者所按压的按钮的信息等操作信息和时间信息(从收集开始起的以毫秒为单位的经过时间)(图12)。 For example, if supplier = 2, recording time information and the operation information and the like of the user presses the button (collected from the start of milliseconds elapsed time) together with the user data in the second array index (12 FIG. ). 在步骤S35, 信息的记录一旦结束,利用者管理服务器43就向利用者代理服务器通知结束。 In the step S35, once the end of recording the information, the user management server 43 on the proxy server to the end user notification.

在以上的处理中,加载平衡器由于仅将呼叫分配到任意的代理服务器,所以能够进行高速处理且能容易地进行增设。 In the above process, since only the load balancer assigned to any call proxy server, capable of high-speed processing can be easily performed additional. 由于利用者代理服务器能够通过简单的计算根据接收到的ID号判明应该转送的利用者管理服务器,所以也能进行高速处理并容易地进行增设。 Since the proxy server to the user, so the high speed processing can be performed by a simple calculation based on the received ID number was found to be transferred and the user management server additional easily. 由于利用者管理服务器能够通过简单的计算判明应该存储数据的利用者信息数组位置,所以也能进行高速处理并容易地进行增设。 Since the management server to the user, so the high speed processing can be performed by a simple calculation was found to be user location information array storing data and an additional easily.

本发明的发明者将该系统实际地链接到电视节目来使用,在高峰时候能够正常地接收并响应几千访问/秒,IO秒钟左右内几万个访问,进行访问的序号赋予。 The present inventors actually linked to the system to use a television program, capable of receiving and responding to access thousands of ID / sec, within about tens of thousands of seconds IO access, access is given normally during peak times.

图8是表示本发明的合计/名次赋予处理的详细情况的流程图。 FIG 8 is a flowchart showing details of the sum / ranking process of the present invention is given. 另外图13〜31是表示合计/名次赋予处理的例子的说明图。 Further is a diagram illustrating FIG 13~31 total / ranking process gives an example. 并且在图13〜31 所示的例子中,配置有服务器索引为0、 1、 2的3台利用者管理服务器(-利用者管理员)。 And, in the example shown in FIG 13~31 disposed index 0 server, the user management server 3 sets of 1, 2 (- administrator user).

利用者管理服务器在步骤S40中,取得第n个利用者的信息数组。 The user management server in step S40, the n-th array acquires information of the user. 并且给每个利用者设定得分。 And the score is set for each user. 在该例中操作信息"3"是正确答案,使受理时间信息(根据减分法)即从收集开始起的以毫秒为单位的经过时间为正确解答者的得分。 In this embodiment, the operation information "3" is the correct answer, so that receives time information (The Save points method) that is collected from the start of milliseconds elapsed time scorers correct answer. 并且,除了每个问题的正确解答者的操作时间信息之外,可以根据需要算出正确解答数、多个问题的正确解答的操作时间的合计时间,和这些的组合等,作为序号赋予的基础的得分信息。 And, in addition to the operation by the time information correct answer each question, correct answer can be calculated according to the number required, the total time of the plurality of questions correct answers operation time, and combinations of these as the basis of the number given score information. 图13、图15是表示步骤S40的处理例的说明图。 FIG 13, FIG 15 is a diagram illustrating an example of the processing step S40.

在步骤S41,根据得分信息,探索交接数组。 At step S41, based on scoring information, explore the transfer array. 图7是表示本发明的交接数组的数据结构的说明图。 FIG 7 is a diagram illustrating a data structure of the transfer array of the present invention. 得分(受理时间)信息如前所述是从收集开始起的以毫秒为单位的经过时间信息,将其看作64比特的得分信息, 在每个用该64比特确定的得分上存储人数或者表示名次的数值数据。 Score (Hours) information as described above is the elapsed time information from the start of the collection in milliseconds, which is regarded as the score of the 64-bit information on each identified by the number 64 is stored or represented bit score Numerical data ranking. 其中,交接数组的数据以256个(=8比特)指针或者数值数据的数组单元为单位,仅生成包含人数是0以外的数据的最下位的数值单元和包含直接或间接指定该单元的指针的指针单元。 Wherein the data transfer array to an array element 256 (= 8 bits) pointer or numerical data as a unit, to generate only contains the number is, and directly or indirectly specify the pointer value means the lowest bit other than 0 data comprising the unit a pointer unit.

交接数组如图7所示有8层,上位的7层分别由前述的64比特的得分信息中的8比特(=256个)的指针单元70、 71、 72…组成。 Layer transfer array 8 shown in FIG. 7, respectively, by the upper layer 7 of the 8-bit 64-bit information scores in (= 256) of the operating unit 70, 71, 72 ... composition. 最下位层是由256个(8比特)的数值组成的数值单元77。 The lowest hierarchical layer 77 is a value of 256 units (8 bits) of the value thereof. 由此,例如在图7 的右上方的数值单元77存储有从收集时间开始后0亳秒〜255亳秒为止进行了正确解答的利用者的人数数据等。 Thus, for example, after the start of the collection time of 0 seconds Bo Bo second ~255 carried out until the number of the correct answer data of the user and the like in the upper right of FIG. 7 value unit 77 is stored. 并且,在该数值单元77中有0 以外的数值的情况下也生成指向该单元的上位的7层的指针单元70、 71、 72…。 Further, the case where value other than 0 point to generate the host cells of the cell pointer 70 of layer 7, 71, 72 ... 77 in the unit value.

如果以毫秒为单位用64比特表示时间,则其长度会成为天文数字, 如果生成交接数组的全部数值单元77,那么数据量也成为天文数字,但在限定的时间段内在得分数据集中的情况下,交接数组数据量有少量就可以,成为个人计算机等能够充分地进行处理的量。 If a 64 milliseconds bit represents time, its length will be astronomical, if the transfer unit generates all values ​​of the array 77, the amount of data can be astronomical, but in the case of a defined time period set in the score data , there is a small amount of data transfer array can become the amount of personal computers can be sufficiently handled.

返回到图8,在步骤S42,从上位判断与64比特的得分信息对应的数组是否存在,在判断结果为否定的情况下进入到步骤S43生成新的数组单元,并为上位单元设定指向该数组单元的指针。 Returning to Figure 8, at step S42, the score from the upper array is determined and the 64-bit information corresponding to the presence or absence, in the case where the judgment result is negative, proceed to the next step S43 to generate a new array element, and means for the upper set point of the pointer array unit. 在步骤S44,判断是否是最下位的数组(=数值单元),在判断结果为否定的情况下进入到步骤S41,为肯定的情况下进入到步骤S45。 In step S44, it is determined whether the lowest bit array (= unit value), into the determination result is negative in the case where the step S41, the affirmative case proceeds to step S45.

在步骤S45,使处于与数值单元内的得分信息对应的位置的人数数据加1。 In step S45, the number of people in the score information corresponding to the position within the numerical data plus 1 unit. 在步骤S46判断对全部的正确解答利用者数据的处理是否己经结束,在判断结果为否定的情况下返回到步骤S40,为肯定的情况下进入到步骤S47。 In step S46, the processing is determined for all the correct answer whether the user data has ended, the process returns to step S40 in the case where the judgment result is negative, the case of affirmative proceeds to step S47. 在步骤S47,将生成的交接数组数据输出到序号赋予服务器。 In step S47, the output array of data transfer to the sequence number given to the generated server.

图14、图16是表示步骤S41〜步骤S45的处理例的说明图。 FIG 14, FIG 16 is an explanatory view showing the processing step S41~ step S45 of the embodiment. 图中的交接数组中的向下的箭头表示指针,x符号表示指针未被设定的状态。 FIG handover array of downward arrows indicates the pointer, x symbol indicates the state pointer is not set. 在图14中,生成/参照至最下位的数组单元(-数值单元),使最下位数组单元的第255地址(与得分的下位8比特=255对应)的人数数据(初始值为0)加1。 In Figure 14, generates / reference to an array element lowermost bit (- value means), so that the lowermost 255th address (the 8-bit lower score = 255 corresponds) bit array unit number data (initial value 0) was added 1. 并且,"参照"是指在上位的指针单元内设定指向下位的单元的指针。 And, "reference" means pointer bits in the pointer is set at the upper unit of the pointing unit. 在图16中,生成下一名次的最下位数组单元,使其第O 个人数数据加1。 In FIG. 16, to generate the next set of bits ranking of the lowermost unit, so that the number of data added to the first individual O 1. 在序号赋予服务器53,在步骤S50,从利用者管理服务器输入交接数组数据。 In a sequence imparting server 53, at step S50, the input array data transfer from the user management server. 在步骤S51,判断从所有服务器的输入是否完成,在判断结果为否定的情况下,进入步骤S50,为肯定的情况下,进入步骤S52。 In the step S51, it is determined whether or input from all servers in the judgment result is negative, the process proceeds to step S50, is affirmative, the process proceeds to step S52. 在步骤S52,通过合计相同得分的人数数据进行多个交接数组的合成。 In step S52, a plurality of transfer arrays synthesized by the same number of data points in total. 在步骤S53,判断所有交接数组的合成是否完成,在判断结果为否定的情况下, 进入步骤S52,为肯定的情况下,进入步骤S54。 In the step S53, the judge of all the transfer array synthesis is completed, the determination result is negative, the process proceeds to step S52, is affirmative, the process proceeds to step S54. 根据以上的处理生成存储有人数数据的数组。 An array number data generated according to the above process is stored. 在步骤S54,进行变量等的初始化。 In step S54, the variables are initialized. 即,设本次的序号=0,下一序号=1,设定注目数组位置为O (=顶端)。 That is, it is assumed for this sequence number = 0, 1 = next sequence, attention is set as the array position O (= top). 在步骤S55,将下一序号的值代入本次的序号。 In step S55, the next sequence of values ​​are substituted into the current sequence number. 在步骤S56,将注目数组的值加到下一序号上。 In step S56, the next sequence number value to the attention of the array. 在步骤S57,将本次的序号的值代入注目数组。 In step S57, the number of times the present values ​​into an array of attention. 在步骤S58,将注目数组的位置+ 1。 At step S58, the attention position in the array of + 1. 在步骤S59,判断所有存在的人数数据的处理是否完成,在判断结果为否定的情况下,进入步骤S55,为肯定的情况下,进入步骤S60。 In the step S59, the process determines the number of all existing data is completed, the judgment result is negative, step S55, is affirmative, the process proceeds to step S60. 通过以上的处理生成存储有序号数据的数组。 No. array of data generated by the above process is stored. 在步骤S60,将生成的序号数组输出到各利用者管理服务器。 In step S60, the array output generated number to each user management server. 图17是表示步骤S50、步骤S51的处理例的说明图。 FIG 17 is a step S50, the step S51 of the described embodiment of the process of FIG. 另外,图18、 图19是表示步骤S52、步骤S53的处理例的说明图。 Further, FIG 18, FIG 19 is a diagram illustrating an example of the processing step S52, in step S53. 在合成数组时,通过进行如下的处理进行合成,即,将存在于所收集的数组中的数值数据单元内的、索引值最小的利用者管理服务器的数值单元与其他的相同得分位置的数值单元的值相加,如果指向该数值单元的指针未被登录在所收集的数组之中的索引值最小的数组中,则进行登录。 In the synthesis of the array, synthesized by the following process, i.e., will be present in the array of the collected numerical data unit, the index value is the smallest value unit user management server with other same scoring position value unit adding a value, if the value of a pointer to the smallest unit is not registered in the index array of the array of the collected, then the log. 在图18、图19, 由于在索引为0的数组中没有名次最高的数值单元,所以索引为1的数值单元被登录到索引为0的数组中,并加上索引为2的相同得分位置的数值单元的第255个数据。 In FIG. 18, FIG. 19, since the index of the array 0 is not the highest value ranking unit, the index value of 1 unit is registered to the index 0 in the array, and coupled with the same index scoring position 2 value of 255 data units. 进而,在下一名次的数值单元的第0个上加上索引为2的相同得分位置的数值单元的第0个数据。 Further, the value of 0 on the next cell ranking plus the index value of 0 the same scoring position data of 2 units. 另外,也可以生成新的数组,将接收到的数组的全部数值数据加到新数组的相同得分位图20〜图27是表示步骤S55〜步骤S59的处理例的说明图。 It is also possible to generate a new array, the entire array of received data values ​​applied to the same score FIG 20~ new bitmap array 27 is a diagram illustrating an example of the processing of step S55~ step S59. 图中第一处理是步骤S55的处理,第2处理是步骤S56的处理,第3处理是步骤S57的处理。 FIG first process is a process of step S55, the second processing is the processing of step S56, the third process is a process of step S57. 另外,从图20进入图21,从图21进入图22期间注目数组位置被+ 1。 Further, FIG. 21 from FIG. 20 enters into attention + 1 array position during FIG. 22 from FIG. 21. 图27表示序号赋予处理已结束的状态,在用指针连结的数值单元中设定有表示名次的1〜8的数值。 FIG 27 shows a state number imparting process has ended, the set value 1~8 numerical ranking indicating unit coupled to the pointer. 利用者管理服务器,在步骤S70输入序号数组。 User management server, at step S70 inputted number array. 在步骤S71,取得第n个人的利用者信息数组。 In the step S71, to obtain the n-th individual user information array. 在步骤S72,对于正确解答者根据得分信息从序号数组取得序号数据,写入到利用者信息数组。 In step S72, the number for the correct answer data are acquired from the number array according to point information, the user information written into the array. 在步骤S73,判断关于全部利用者的序号赋予处理是否已经结束,在判断结果为否定的情况下, 进入步骤S71,为肯定的情况下,结束处理。 In the step S73, to determine the serial number on all of a user's given whether the processing has been completed, the decision result is negative, the process proceeds to step S71, to the affirmative case, the process ends. 通过以上的处理,在各利用者管理服务器的利用者信息内写入名次。 By the above process, the user writes in the ranking information of each user management server. 图28是表示步骤S70的处理例的说明图。 FIG 28 is a diagram illustrating an example of the processing in step S70. 图29是表示步骤S71的处理例的说明图。 FIG 29 is a diagram illustrating an example of the processing of step S71. 在该例中,取得关于利用者2 (索引为O)的信息。 In this embodiment, the user obtains information about the 2 (index O) a. 图30是表示步骤S72的处理例的说明图。 FIG 30 is a diagram illustrating an example of the processing in step S72. 在该例中,根据利用者2的得分(255)探索序号赋予数组,取得名次数据"2",并设定到利用者信息数组。 In this embodiment, the score according to the user 2 (255) are sequentially assigned to explore the array, the data acquired rank "2", and set the user information array. 图31是表示在所有的利用者服务器中序号赋予处理已结束的状态的说明图。 FIG 31 is an explanatory view showing a state of the processing has been completed are sequentially assigned to all the user server. 实施例2下面对第2实施例进行说明。 Example 2 Next, a second embodiment will be described. 在第一实施例中由序号赋予服务器53 进行序号数据的生成,但必须将全部利用者管理服务器43的数据收集到序号赋予服务器53,进行交接数组的合成,所以可能在处理上存在瓶颈。 In the first embodiment, the number given to the server 53 generates ID data, but all data must be collected by the user management server 43 to the server 53 sequentially assigned, combining the transfer of the array, there may be a bottleneck in the process. 另外,在序号赋予服务器53进行处理中,利用者管理服务器43处于等待结果的状态而不进行处理。 Further, the number 53 is given to the server process, the user management server 43 results in a wait state without processing. 因此在第2实施例中,通过在多个利用者管理服务器43分散进行加法合成和序号数据的生成处理,能够容易地扩充处理能力。 Therefore, in the second embodiment, the user management server 43 a plurality of decentralized generation processing and additively combining the data sequence number, it is possible to easily expand the processing capability. 图32是表示本发明的第二实施例的各装置间的交换的流程图。 FIG 32 is a flowchart of the exchange among devices of the second embodiment of the present invention. 在第二实施例中,不设置序号赋予服务器,而在利用者管理服务器43生成序号数据。 In the second embodiment, the set number is not given to the server, and the production number data in the user management server 43. 与第一实施例的不同点仅在步骤S27的部分。 Embodiment differs from the first embodiment only in part of the step S27. 图33是表示本发明的第二实施例的合计/序号赋予处理的说明图。 FIG 33 is a diagram illustrating the sum / number of the second embodiment of the present invention imparts processing. 虽然作为第二实施例,例如将利用者管理服务器43的台数设为3台,但该台数可以任意进行增减。 Although as the second embodiment, for example, the user management server 43 is set to the number of three, but the number may be arbitrarily increased or decreased. 在各利用者管理服务器0 (82)〜2 (82〉中存在有受理数据80〜82即存储有各个利用者的操作信息的利用者信息。 在各利用者管理服务器中,将该受理数据进行分割,生成相当于管理服务器台数的交接数组。该数组的结构与图7所示相同。为了使各数组的数据量平均,根据得分的下位值进行分配。(详情后述)在各利用者管理服务器,从其他服务器取得应该自己合成的交接数组,关于应该在其他的服务器合成的交接数组则发布到其他的服务器。 例如在利用者管理服务器0 (80),将生成的3个数组83〜85之中的两个数组84、 85发布到其他服务器,并从其他利用者管理服务器1、 2取得两个数组B-0(86)、 C-0(89)。在取出应该自己合成的交接数组后,进行数组的加法合成。例如利用者管理服务器0 (80)从3个数组A-0(83) 、 B-0 (86) 、 C-0(89)加法合成数组ABC-0(92)。由于加法合成通 I.e. there 80~82 receives data stored in the user information of the operation information of the respective user (82> in each of the user management server 0 (82) ~ 2. In each of the user management server, receives the data segmentation, generating equivalent transfer arrays limited to the management server table. same as shown in Figure 7 configuration diagram of the array. in order to make the amount of data of each array on average, be allocated according to the lower value of the score is. (described in detail later) of each user managed in server should get its own synthesis from other servers transfer array, the array should be synthesized on the transfer of other servers in the release to other servers. For example, in the user management server 0 (80), and the resulting three arrays 83~85 among the two arrays 84, 85 to release the other servers, and two arrays to obtain B-0 (86) from another user management server 1, 2, C-0 (89). It should be taken in their transfer array synthesis after additively combining the array. for example the user management server 0 (80) from the three arrays a-0 (83), B-0 (86), C-0 (89) additively combining array ABC-0 (92) Since the additive synthesis on 过多个服务器进行分散处理,所以通过增减服务器数量,能够容易地增减处理能力。加法合成的数组也发布到其他所有利用者管理服务器。由此在全部利用者管理服务器中在发布结束的时刻,保持有将全部利用者管理服务器加法合成的相同的数组ABC-0(92)、 ABC-1(93)、 ABC-2(94)。加法合成的数组存储有各得分(经过时间)的人数数据。然后将该人数数据从先头进行累计并转换为序号数据ABO0(95)、 ABC-1(96)、 ABC-2(97)。该处理在各利用者管理服务器并行进行。另外,也可以在l 台利用者管理服务器上转换为序号数据,然后将其结果发布到全部利用者管理服务器,但花费在序号赋予上的时间是大致相同的。根据以上的处理,各利用者管理服务器保持有存储有序号数据的相同数组ABC-0(95)、 ABC-1(96)、 ABC-2(97)。最后,参照该序号数据,给各利用者管理服务器所管理的 A plurality of servers through the dispersion treatment, so by increasing or decreasing the number of servers, the processing capacity can be easily increased or decreased. Additive synthesis array also issued to all other user management server. Thus all the user management server at the distribution end time, holds the same array ABC-0 all user management server additive composition (92), ABC-1 (93), ABC-2 (94). synthesis of the array stores adder with a respective score (elapsed time) the number of data then the number of accumulated data from the head and converted into serial data ABO0 (95), ABC-1 (96), ABC-2 (97). this processing is performed in parallel in the user management server. in addition, can be switched on l station user management server is a serial number data, and then publish the result to the entire user management server, but the time spent in the number given on substantially the same. according to the above process, each user management server holding a memory array have the same number of data ABC-0 (95), ABC-1 (96), ABC-2 (97). Finally, referring to the serial data, the management server to each user managed by 利用者信息(受理数据)赋予序号。图34是表示本发明的第二实施例的步骤S27的序号赋予处理的流程图。该处理根据来自状态管理服务器51的合计指示在各利用者管理服务器43分别被起动。在步骤S80准备利用者管理服务器台数的交接数组, 在步骤S81,调用后述的数组生成处理。在这里生成相当于利用者管理服务器台数的交接数组。在步骤S82,将O代入变量a。在步骤S83,在交接数组被准备好后, 从第a个服务器取得在本服务器加法运算的交接数组数据。 User information (data accepted) given sequence number. FIG. 34 is a flowchart showing the serial number of the steps of a second embodiment of the present invention embodiment S27 imparting process. The process in accordance with an instruction from the aggregate status management server 51 in the user management server 43 are started. in step S80 ready to use the transfer array number by the management server table, in step S81, the array generating process after the call later. generated here corresponds to the transfer array number of the user management server station. in step S82, the O substituting a variable. in step S83, after the array is ready for the handover acquires an array of data transfer in the present server from adding a servers. 在步骤S84, 判断a是否大于等于利用者管理服务器台数max,在判断结果为否定的情况下进入到步骤S85,为肯定的情况下进入到步骤S86。 In step S84, a determination is greater than equal to the number of the user management server station max, in the case where the judgment result is negative, to go to the next step S85, the affirmative case proceeds to step S86. 在步骤S85将a 加1然后进入到步骤S83。 In a step S85 to add 1, and then proceeds to step S83. 在步骤S86,在本服务器将应该处理的全部交接数组的内容进行加法合成。 In step S86, the contents all additively combining the array of the present delivery server to be processed. 合成方法与第一实施例的步骤S52、步骤S53的处理相同。 Step in the synthesis method of the first embodiment of the S52, the same process of step S53. 在步骤S87,将O代入变量a。 In step S87, the O is substituted into the variable a. 在步骤S88,在交接数组数据被准备好后,从第a个服务器取得已加法合成的交接数组数据。 In step S88, the data in the array is ready to transfer, the transfer of the array data is acquired from the addition of a synthetic servers. 在步骤S89,判断a是否大于等于管理服务器台数max,在判断结果为否定的情况下进入到步骤S90,为肯定的情况下进入到步骤S91。 In step S89, the determination whether a is not less than the number of the management server max, to the next determination result is negative in the case where the step S90, the affirmative case proceeds to step S91. 在步骤S90将a加1然后进入到步骤S88。 In a step S90 to add 1, and then proceeds to step S88. 根据以上的处理,全部利用者管理服务器43都成为保持有已被加法合成的相同数组的状态。 According to the above process, the entire user management server 43 will be held the same array have been synthesized addition state. 在步骤S91,调用序号转换处理。 At step S91, call number conversion process. 通过该处理,数组内的人数数据被累计并被转换为序号数据。 By this process, the number of data in the array is accumulated and converted to serial data. 在步骤S92,调用序号赋予处理。 In step S92, the call process number given. 根据该处理, 向各利用者管理服务器所管理的利用者信息(受理数据)赋予序号。 According to this process, each user managed by the user information management server (Receive data) given sequence number. 图35是表示本发明的第二实施例的数组生成处理(步骤S81)的流程图。 FIG 35 is a flowchart showing the processing (step S81) array of the second embodiment of the present invention generates. 该处理是生成被分割为相当于利用者管理服务器台数的利用者信息的交接数组的处理。 This process is to generate the handover process is divided into an array corresponding to the user number of the user information management server table. 在步骤SIOO,在根据未处理的利用者信息(受理数据)算出得分信息的同时写入到利用者信息。 In step SIOO, the score is calculated while the information according to the user information unprocessed (Receive data) is written into the user information. 在步骤SlOl,把对利用者的得分除以预先设定的管理服务器台数后的余数代入变量b。 In step SlOl, the score of the user is divided by the number of generations of the management server after the number of pre-set into the variable b. 在步骤S102,把对利用者的得分除以管理服务器台数后的商数代入变量c。 In step S102, the quotient is divided by the number of scores of the user management server table is substituted into the variable c. 在步骤S103,选择第b个交接数组。 In step S103, the selected handover b th array. 在步骤S104,根据变量c的值按照顺序从上位开始探索交接数组。 In step S104, based on the value of the variable c in the order from the upper array begins to explore the handover. 具体地,将C按照每个与阶层对应的比特数分为阶层数个,检査在从上位将数组单元内的c进行了划分的值对应的地址上有无指示下位的数组单元的有效的指针。 Specifically, the class C and the number of bits each corresponding to a plurality of sectors divided, checks carried out from the upper cell within an array of c corresponding to the value indicative of the presence or absence of division of the address bits of the array elements effective pointer. 在步骤S105,判断下位的数组是否存在,在判断结果为否定的情况下进入到步骤S106,为肯定的情况下进入到步骤S107。 In step S105, the bit array determined whether there, into the determination result is negative in the case where the step S106, affirmative case proceeds to step S107. 在步骤S106,新生成下位的数组单元和指示其的指针。 In step S106, the newly generated bit array indicating which cell pointers. 在步骤S107,判断是否是最下位数组,在判断结果为否定的情况下进入到步骤S104,为肯定的情况下进入到步骤S108。 In step S107, it is determined whether the lowest median group, enter the result of the determination is negative in the case to step S104, affirmative case proceeds to step S108. 在步骤S108,在与最下位的数组单元内的c的下位规定比特对应的人数数据上加1。 In step S108, the array element at the lowermost position of the lower bits c 1 plus a predetermined number of bits corresponding to the data. 在步骤S109,判断是否已结束,在判断结果为否定的情况下进入到步骤SIOO,为肯定的情况下结束处理。 In step S109, the judge has ended, go to step SIOO in judgment result is negative, the case of positive end processing. 通过以上的处理, 生成分割为利用者管理服务器台数的交接数组。 By the above process, generating a handover is divided into an array of numbers the user management server table. 由于各数组的信息量按照得分信息的下位的值(b)进行分配,所以包含于各数组的人数信息大体均等,可以期待在利用者管理服务器中的加法合成处理的负荷也大体均等。 Since the amount of information of each array are allocated according to the value (b) under point information bits, the number of information contained in each array is substantially uniformly can be expected additive synthesis processing load in the user management server also substantially equal. 图36是表示本发明的第二实施例的序号转换处理(步骤S91)的内容的流程图。 FIG 36 is a flowchart showing the content of the sequence number conversion process of the second embodiment of the present invention (step S91) is. 在步骤S120,进行变量等的初始化(J(人数数据临时保持变量)-O、 K (序号数据)=1、 P (最上位阶层的数组扫描用计数变量) =0、 L (阶层)=0 (最上位))。 In the initialization step S120, the variables, etc. for (J (the number of data temporarily hold variable) -O, K (data number) = 1, the scanning array P (uppermost hierarchy by the count variable) = 0, L (class) = 0 (uppermost)). 在步骤S121,检查最上位的数组单元的第P个指针是否有效(存在)。 In step S121, the pointer P-th array element uppermost inspection is valid (exists). 在步骤S122,判断出是否有效,在判断结果为否定的情况下进入到步骤S124,为肯定的情况下进入到步骤S123。 In step S122, it determines whether valid, entering the determination result is negative in the case where the step S124, the affirmative case proceeds to step S123. 在步骤S123,将阶层值(L+l)和步骤S121中的有效指针信息作为自变量,调用下位阶层子程序。 In step S123, the valid pointer information level value (L + l) and the step S121 as arguments, the subroutine calls the lower hierarchy. 在步骤S124,将P加1。 In step S124, the P-1 was added. 在步骤S125, 判断P是否大于等于256,在判断结果为否定的情况下进入到步骤S121, 为肯定的情况下结束处理。 In step S125, determines whether P is greater than equal to 256, proceeds to step S121 in the case where the judgment result is negative, the affirmative case the process ends. 图37是表示第二实施例的下位阶层子程序的流程图。 FIG 37 is a flowchart showing a subroutine of the lower strata of the second embodiment. 该处理子程序在每个阶层被循环调用,在子程序中使用的变量在各个阶层中分别独立。 The processing loop subroutine is invoked at every level, variables used in the subroutine are each independently in each hierarchy. 另外,最下位的阶层中进行的处理和在中间阶层中进行的处理是分离的。 Further, the process and the processing in the intermediate class hierarchy for the lowest bit is isolated. 在步骤S130,判断是否为最下位层,在判断结果为否定的情况下进入到步骤S131,为肯定的情况下进入到步骤S137。 In step S130, determines whether or not the most lower layer, the determination result is negative the process proceeds to step S131, affirmative case proceeds to step S137.

步骤S131〜步骤S136是中间阶层(L=l〜6)的处理。 Step S136 is a step S131~ middle class (L = l~6) process. 在步骤S131, 进行初始化使PO。 In step S131, it initializes make PO. 在步骤S132,检査根据来自上位的子程序的自变量指定的数组单元的第P个指针是否有效(存在)。 At step S132, the pointer P-th array element checks specified by the argument from the upper subroutine is valid (exists). 在步骤S133,判断是否有效,在判断结果为否定的情况下进入到步骤S135,为肯定的情况下进入到步骤S134。 In step S133, the judgment is valid, enter in the judgment result is negative circumstances to step S135, affirmative case proceeds to step S134.

在步骤S134,将阶层值(L+l)和步骤S132中的有效指针信息作为自变量,调用下位阶层子程序。 In step S134, the value of the class (L + l) and a valid pointer information in step S132 as arguments, the subroutine calls the lower hierarchy. 在步骤S135,将P加1。 In step S135, the P-1 was added. 在步骤S136, 判断P是否大于等于256,在判断结果为否定的情况下进入到步骤S132, 为肯定的情况下结束处理并返回到原来的子程序。 In step S136, the P is greater than equal to 256 is determined, proceeds to step S132 in the case where the judgment result is negative, the affirmative case the process ends and returns to the original routine.

步骤S137〜步骤S147是最下位层(L=7)的处理。 S137~ step S147 is a processing step at the lowest level (L = 7) of. 在步骤S137,进行初始化使PO。 In step S137, the initialized so PO. 在步骤S138,将从上位子程序交接来的有效的数组数的计数变量Q初始化为1。 Array count of the number of valid variable step S138, the program transfer from the seat to the Q is initialized to 1. 在步骤S139,读出第Q个数组单元的第P个人数数据。 In step S139, the read out of the personal digital Q P-th data array unit.

在步骤S140,判断人数是否大于等于1,在判断结果为否定的情况下进入到步骤S144,为肯定的情况下进入到步骤S141。 In step S140, the determined number is greater than or equal to 1, proceeds to step S144 in the case where the judgment result is negative, the case of affirmative proceeds to step S141. 在步骤S141,为了临时保持人数数据,将其代入变量J。 In step S141, in order to keep the number of temporary data, which is assigned to the variable J. 在步骤S142,将名次K写入到第Q个数组单元的第P个中。 In step S142, the ranking K will be written into the first of the P Q array unit. 在步骤S143,将J+K代入名次K,进行名次更新。 In step S143, the J + K substituting the rank K, for ranking update.

在步骤S144,将Q加1。 In step S144, the increase of Q 1. 在步骤S145,判断Q是否比从上位子程序交接来的有效的数组数大,在判断结果为否定的情况下进入到步骤S139, 为肯定的情况下进入到步骤S146。 In step S145, the determination of Q is larger than the effective seat of the array transferred from the program, the process proceeds in the case where the judgment result is negative, the step S139, the affirmative case proceeds to step S146. 在步骤S146将P加1。 In step S146 the adding P 1. 在步骤S147, 判断P是否大于等于256,在判断结果为否定的情况下进入到步骤S138, 为肯定的情况下结束处理并返回到原来的子程序。 In step S147, the P is greater than equal to 256 is determined, proceeds to step S138 in the case where the judgment result is negative, the affirmative case the process ends and returns to the original routine. 通过以上的处理,各数组内的人数数据被转换为序号数据。 By the above process, the number of data in each array are converted to serial data.

图38是表示本发明的第二实施例的序号赋予处理(步骤S92)的内容的流程图。 FIG 38 is a flowchart showing the processing content is given (step S92) a second number of embodiments of the present invention. 在步骤S150,从利用者信息数组取得未处理的得分信息。 In step S150, the information from the score acquired unprocessed user information array. 在步骤S151,把对利用者的得分除以管理服务器台数后的余数代入变量b。 In step S151, the score is divided by the number of user management server table remainder assigned to the variable b. 在步骤S152,把对利用者的得分除以管理服务器台数后的商数代入变量c。 In step S152, the number of the scores is divided by the quotient of the user management server table is substituted into the variable c. 在步骤S153,选择第b个交接数组。 In step S153, the selected handover b th array.

在步骤S154,根据变量c的值搜索交接数组。 In step S154, the value of the search array in accordance with the transfer of the variable c. 在步骤S155,根据变量c的值从最下位数组单元读出序号数据,写入到相应的利用者信息。 In step S155, the value of the variable c in accordance with the lowest number of bits is read out from the unit number group data, written to the corresponding user information. 在步骤S156,判断是否结束,在判断结果为否定的情况下进入到步骤S150,为肯定的情况下结束处理并返回到原来的子程序。 In step S156, the determination is finished, proceeds to step S150 in the case where the judgment result is negative, the affirmative case the process ends and returns to the original routine.

虽然揭示了以上的实施例,但也可以考虑如下的变形例。 Although the above disclosed embodiments, but may be considered following modifications. 在实施例中,揭示了使用移动终端的例子,也可以使用连接在因特网上的一般的PC终端。 In an embodiment, there is disclosed an example of using a mobile terminal, may be connected to the terminal using a general PC on the Internet. 在这种情况下,也可以例如按照向登录服务器的接受顺序向多个利用者管理服务器进行分配。 In this case, it may be allocated to a plurality of the user management server, such as receiving sequence according to the login server.

虽然作为实施例揭示了将直至操作为止的时间作为得分来赋予序号的例子,但下面揭示更有效地使用本发明的交接数组的方法。 Although the embodiments disclosed as the time until the operation until the scores given by way of example the sequence number, but the following method disclosed in more effective use of the transfer array of the present invention. 在该例中, 通过一次的序号赋予处理,赋予序号使得正确解答问题数多的利用者处于更靠前的位置,在正确解答问题数相同的情况下正确解答平均时间短的利用者处于更靠前的位置。 In this embodiment, the number given by one process, so that the correct answer is given sequence number number number of questions the user in a more forward position, the correct answer in the case where the same number of questions correct answer short time average is closer to the user position before.

例如在利用者A答对3题、正确解答平均时间为13秒,利用者B答对2题、正确解答平均时间为13秒,利用者C答对2题、正确解答平均时间为5秒的情况下,例如用以下的算式求出得分。 For example, answer the user A 3 question, correct answer average time of 13 seconds, and the user B answer two questions, correct answer average time of 13 seconds, the user C answer two questions, correct answer average time of a case where 5 seconds, e.g. scores obtained by the following equation.

得分=(OxFFFFFFFFFFFFFFFF -正确解答数* OxlOOOOOOOO+正确解答平均时间) Score = (OxFFFFFFFFFFFFFFFF - the number of correct answers correct answer * OxlOOOOOOOO + average time)

该公式的含义是:数组能表示的最大数一将正确解答数向左移位能够数组表现的最大数的一半(32比特)十正确解答平均时间。 The meaning of the equation is: the maximum number of the array can be represented by a correct answer can be shifted to the left half of the number of array performance is the maximum number (32-bit) average time ten correct answer. 各人的得 Every man was

分如下: Divided as follows:

利用者A A user

0xFFFFFFFFFFFFFFFF-0x300000000+0xD=0xFFFFFFFD0000000C 利用者B 0xFFFFFFFFFFFFFFFF-0x300000000 + 0xD = 0xFFFFFFFD0000000C user B

OxFFFFFFFFFFFFFFFF-0x200000000+0xD=0xFFFFFFFE0000000C 利用者C OxFFFFFFFFFFFFFFFF-0x200000000 + 0xD = 0xFFFFFFFE0000000C user C

OxFFFFFFFFFFFFFFFF-0x200000000+0x5 = 0xFFFFFFFE00000004 由于本发明的系统是按照值增大的顺序赋予序号的,所以利用者A是第一位,利用者B是第三位,利用者C是第二位。 OxFFFFFFFFFFFFFFFF-0x200000000 + 0x5 = 0xFFFFFFFE00000004 Since the system of the invention is given sequence number value is increased in accordance with the order, the user A is the first, the third is the user B, user C is second.

这样,在数组能够表示的范围内通过对操作信息和存储信息、受理时间等的各数据进行比特移位和+ —的替换和组合,能够对应各种各样的序号赋予。 And combinations of replacement, it is possible to impart a corresponding variety of number - Thus, the operation information and the stored information, each time the data receives the bit shift and the like in the range of + can be represented by the array. 因此,在该例中,交接数组在0xFFFFFF (上位3段)的下面使用两个数组,其余使用各一个数组,仅使用13个总共256个要素的数组就能够表示数据。 Thus, in this embodiment, the transfer array 0xFFFFFF (upper segment 3) below using the two arrays, an array using each remaining, using only a total of 13 array elements 256 can represent data. 即,本发明的交接数组具有在存在大量的近^^的值时最能表现出数据压缩效果的特征。 That is, the transfer array of the present invention has a value in the presence of a large number of the most recent ^^ exhibit characteristic data compression.

在该例中,在正确解答数在1〜10(0xA)之间、秒数在0〜255(0xFF) 秒的范围内的情况下,即使存在10亿人的信息,各阶层的数组为1 + 1 + 1+0xA+0xA+0xA+0xA+0xA=53,即53X256X4Byte (—般的1要素的大小),最大不超过约54KByte。 In this embodiment, the number of correct answers between 1~10 (0xA), in the case where the number of seconds within the range of 0~255 (0xFF) sec, even if the information exists billion people, all sectors of the array 1 + 1 + 1 + 0xA + 0xA + 0xA + 0xA + 0xA = 53, i.e. 53X256X4Byte (- like the size of the element 1), the maximum does not exceed about 54KByte. 另外,在正确解答数在1〜100(0x64) 之间、秒数在0〜65535 (0xFFFF)这样比较大的范围内的情况下,最大不超过约26MByte,即1 + 1 + 1+0x64+0x64+0x64+0x64 + (0x64*0xFFO =26003。实际上,由于正确解答数和正确解答时间有聚集(一边倒)现象,所以数据量变得更少。像这样,即使不连续,在一边倒多的得分上也会出效果。 Further, the correct answer number between 1~100 (0x64), the number of seconds in the case of such a relatively large range 0~65535 (0xFFFF), the maximum does not exceed about 26MByte, i.e. 1 + 1 + 1 + 0x64 + 0x64 + 0x64 + 0x64 + (0x64 * 0xFFO = 26003. in fact, due to the number of correct answers and the correct answers have gathered time (one-sided) phenomenon, the amount of data becomes less. as such, even if not continuous, one-sided in many score on the effect will be.

在实施例中,讨论了以利用者的按钮操作为触发器,接收按钮信息进行处理的例子。 In an embodiment, an example is discussed in a button operation of the user as a trigger, reception button information to be processed. 但本发明也能够应用如下的触发器和信息的组合进行灵活的信息收集。 However, the present invention is also applicable to a combination of the following trigger information and flexible information gathering. 例如可以考虑以下的操作信息的发生方法(触发器)。 The following methods may be considered, for example, occur in the operation information (trigger). (1)操作触发器,(2) 0〜9 (0〜9的数字键等)的操作,(3) l〜 12 (电视的遥控器等)的操作,(4)其他的(色和形等)各种按钮的操作,(5)选择(一览等)操作,(6)明暗(光传感器)变化,(7)气温(温度计)变化,(8)气压(气压计)变化,(9)速度(速度计和陀螺仪等)变化,(10)加速度(陀螺仪等等)变化,(11)时间(表和GP S 等)变化,(12)位置(GPS等)变化,(13)高度(GPS等)变化,(14) 感情(脑波等)变化,(15)动作(姿势等的变化等)变化,(16)其他可被判断出变化的操作信息的发生方法。 (1) The operation of the trigger, (0 ~ 9 numeric keys, etc.) (2) 0 ~ 9 operation, (3) Operation l~ 12 (television remote controller), and (4) other (the shape and color etc.) the operation of various buttons, (5) selection (list, etc.) operation, (6) and dark (light sensor) changes, (7) temperature (thermometer) changes, (8) the pressure (gauge pressure) changes, (9) speed (speedometer and gyroscope) changes, (10) acceleration (gyro, etc.) changes, (11) time (table GP S and the like) changes, (12) the position (GPS, etc.) changes, (13) the height (GPS, etc.) changes, (14) emotions (electroencephalogram, etc.) changes, (15) the operation (posture change and the like) changes, (16) other methods can be judged that the operation information of the occurrence of a change.

另外,可以考虑下述信息作为操作信息。 Further, consider the following information as the operation information. (1)数字信息,(2)文字信息,(3)选择子信息,(4)明暗信息,(5)气温信息,(6)气压信息,(7)速度信息,(8)加速度信息,(9)时间信息,(10)位置信息,(11) (1) the digital information, (2) character information, (3) selection sub-information (4) shading information, (5) temperature information, (6) air pressure information, (7), velocity information, (8), acceleration information, ( 9) the time information (10) position information, (11)

高度信息,(12)感情信息,(13)动作信息 Height information, (12) the feeling information (13) motion information

本发明的系统,适用于与观众参与的电视节目联动、合计利用者操 The system of the present invention, suitable for interaction with the viewer participation television program, the user operations total

作了的回答信息等并反映给节目的系统等需要在短时间内进行序号赋予 The answer made to the program information and reflect the need for a system such as the serial number given in a short time

处理的系统。 Processed by the system. 而且,本发明的序号赋予系统不限于与电视节目联动的系 Further, the present invention is the serial number system is not limited to a given television program with the linkage system

统,可以适用于票销售、赌博和比赛的赌率合计、拍卖、网络游戏的等级等在有限的时间内集中大量的访问且需要进行序号赋予的任意的系统。 The system can be applied to ticket sales, the rate of gambling and gambling game together, auctions, online games focus on large levels of access within a limited period of time and need to be given to any number of systems.

Claims (3)

1.一种合计系统,其特征在于,该合计系统具有负荷分散装置、多个利用者代理服务器装置和多个利用者管理服务器装置, 所述负荷分散装置将经由通信网从终端发送来的访问分配给所述多个利用者代理服务器装置,所述访问包含基于终端利用者的操作的操作信息和预先被赋予的ID号; 所述多个利用者代理服务器装置是分别通过LAN与所述负荷分散装置连接的多个计算机,其安装有用于使所述多个计算机的每一个发挥操作信息转送单元功能的程序,所述操作信息转送单元根据从所述负荷分散装置接收到的所述访问所包含的所述ID号除以所述多个利用者管理服务器装置的总数N所得到的余数M,确定利用者管理服务器装置号与所述余数M一致的利用者管理服务器装置,并将包含所述操作信息和ID号的访问转送给所述确定的利用者管理服务器装置; 所述多个 A total system, characterized in that the aggregate system has a load balancer, a plurality of user proxy server apparatus and a plurality of user management server apparatus, the load distributing apparatus transmitted from the access terminal via the communication network assigned to the plurality of user proxy server apparatus, comprising the access terminal based on the operation information of the operation and the user ID number previously given; proxy server of the plurality of user devices via a LAN with respectively said load dispersing a plurality of devices connected to the computer, a program which is installed for each of the operation information transfer unit functions to play the plurality of computers, the operation information transfer unit according to the access load distributing means from the received comprising the plurality of the ID number by the user management server apparatus total number N M of the obtained residue, the user management server apparatus determines the number M remainder consistent user management server apparatus, and containing the ID information and said access operation to said determined number of revolutions of the user management server apparatus; a plurality of 用者管理服务器装置是分别通过LAN与所述多个利用者代理服务器装置连接并按照顺序被赋予所述利用者管理服务器装置号的多个第2计算机,其安装有用于使所述第2计算机发挥如下单元功能的程序: 存储单元,其存储信息; ID生成单元,其基于所述访问之前来自所述终端的登录请求,根据利用者管理服务器装置的总数N、利用者管理服务器装置号M以及分配给所述终端的所述存储单元中的新数组位置I来生成终端固有的ID号,并通知给所述终端;以及利用者管理单元,其根据从所述利用者代理服务器装置接收到的所述访问所包含的所述ID号除以所述多个利用者管理服务器装置的总数N所得到的商I,将所述访问所包含的所述操作信息与从受理开始起的经过时间信息一起存储在所述存储单元中的与所述商I一致的数组位置。 Wearer management server apparatus is connected and the order is given by the management server apparatus using a plurality of the second number of the plurality of computers over a LAN by using a proxy server device, which is mounted for causing the second computer program means exerts the following functions: storage means for storing information; ID generating means, based on a login request from the terminal prior to the access, the user management server apparatus according to the total number N, the user management server apparatus and the number M assigned to the new location of the memory cell array of the terminal in the terminal I to generate a unique ID number, and notifies the terminal; and a user management unit, based on the user from the proxy server to the receiving apparatus the ID number included in the access provider divided by the plurality of I user management server apparatus of the obtained total number N, the operation information included in the access from the reception start and the elapsed time information I coincident with the provider is stored in the array position of the storage unit.
2,根据权利要求l所述的合计系统,其特征在于,所述利用者管理服务器装置还安装用于发挥页发送指示单元功能的程序,该页发送指示单元在所述利用者管理单元的处理结束的情况下,指示所述利用者代理服务器装置向对应的所述终端发送下一个Web页信息,所述利用者代理服务器还安装用于发挥页发送单元功能的程序,该页发送单元根据终端利用者的操作,将能够发送包含所述ID号的操作信息那样的操作页信息向所述终端发送。 2, according to the total system of claim l, wherein said user management server apparatus further Setup page transmission instructing means for exerting the function, the process instruction unit transmits the page in the user management unit end of the case, indicating the user proxy device transmits to a next Web page corresponding to the terminal, the proxy server further user Setup page transmitting unit for exerting the function, according to the terminal unit transmits the page operation information such as page information of the operation of the user, will be able to transmit comprises transmitting the ID number to the terminal.
3. —种合计方法,其特征在于,该合计方法包含以下步骤:基于来自终端的登录请求,根据利用者管理服务器装置的总数N、 利用者管理服务器装置号M以及分配给所述终端的所述存储单元中的新数组位置I来生成终端固有的ID号,并通知给所述终端;负荷分散装置将经由通信网从所述终端发送来的访问分配给多个利用者代理服务器装置,所述访问包含基于终端利用者的操作的操作信息和所述ID号;作为分别通过LAN与所述负荷分散装置连接的多个计算机的利用者代理服务器装置,根据从所述负荷分散装置接收到的所述访问所包含的所述ID号除以利用者管理服务器装置的总数N所得到的余数M,确定利用者管理服务器装置号与所述余数M —致的利用者管理服务器装置,并将包含所述操作信息和ID号的访问转送给所述确定的利用者管理服务器装置;作为分别通过 3. - The method of the total species, characterized in that the total method comprising: based on a login request from the terminal, the total number N of the user management server apparatus, the user management server apparatus M and the number assigned to the terminal by the new position of the array of said storage unit I generates a unique ID number of the terminal, and notifies the terminal; transmitting the load distributing means to a plurality of access assigned to the user terminal from the proxy server apparatus via a communication network, the comprising said access terminal based on the operation information and the user ID number; as by a plurality of user computers each LAN device is connected to the load distributing apparatus proxy server, from a dispersion device according to the received load the ID number contained in said access is divided by the number M of the user management server apparatus of the obtained total number N, the user management server apparatus determines the number M remainder - induced user management server apparatus, and comprising the operator user access information management server apparatus and transferred to the ID number determined; as respectively UN与所述多个利用者代理服务器装置连接并按照顺序被赋予利用者管理服务器装置号的多个第2计算机的利用者管理服务器装置,根据从所述利用者代理服务器装置接收到的所述访问所包含的所述ID号除以利用者管理服务器装置的总数N所得到的商I,将所述访问所包含的所述操作信息与从受理开始起的经过时间信息一起存储在所述存储单元中的与所述商I一致的数组位置。 UN and the plurality of proxy servers connected user and the user is given the order management server apparatus a plurality of the user management server apparatus No. 2 of the computer, received from the user device to the proxy server according to the ID number contained in the access user I divided by the total number N management server apparatus obtained, the operation information included in the access to the information stored together with the elapsed time from start of acceptance of the storage I position of the array of identical supplier unit.
CN 200910142514 2003-11-10 2004-10-29 Compilation system CN101651715A (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
JP2003-379467 2003-11-10
JP2003379466 2003-11-10
JP2003-379466 2003-11-10
CN200480007643.3 2004-10-29

Publications (1)

Publication Number Publication Date
CN101651715A true CN101651715A (en) 2010-02-17

Family

ID=36707412

Family Applications (2)

Application Number Title Priority Date Filing Date
CN 200910142514 CN101651715A (en) 2003-11-10 2004-10-29 Compilation system
CN 200480007643 CN1762141B (en) 2003-11-10 2004-10-29 Compilation system

Family Applications After (1)

Application Number Title Priority Date Filing Date
CN 200480007643 CN1762141B (en) 2003-11-10 2004-10-29 Compilation system

Country Status (1)

Country Link
CN (2) CN101651715A (en)

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020095676A1 (en) 1998-05-15 2002-07-18 Robert A. Knee Interactive television program guide system for determining user values for demographic categories

Also Published As

Publication number Publication date
CN1762141A (en) 2006-04-19
CN1762141B (en) 2010-05-26

Similar Documents

Publication Publication Date Title
US6304902B1 (en) Latency server and matchmaker
CN1109298C (en) System and method for server-side optimization of data delivery on distributed computer network
CN102043897B (en) The game based on browser is carried out using alternative controls and interface
US6203433B1 (en) Network game system, a network game server, a network game client, a player selection program, a medium storing a player selection program, and a medium storing a player information collection program
US8260846B2 (en) Method and system for providing targeted content to a surfer
US20080256243A1 (en) Method and system for identifying available resources in a peer-to-peer network
US6763371B1 (en) Method and apparatus for collaborative communication in a communication network
US9396295B2 (en) Method and system for creating a predictive model for targeting web-page to a surfer
JP4122297B2 (en) How the message analysis device and a message display
US20130080348A1 (en) Systems and Methods for Capturing Event Feedback
CN1682224B (en) A data network, user terminal and method for providing recommendations
JP5130576B2 (en) System and method for providing effectively the client device the content in an electronic network
JP4499716B2 (en) The execution of the application in a peer-to-peer network
US8346743B2 (en) Configuring data collection rules in a data monitoring system
US7133908B1 (en) Metrics and status presentation system and method using persistent template-driven web objects
JP5279472B2 (en) System and method for dynamically generating user interfaces for network client device
RU2527200C2 (en) Apparatus and method of establishing and using backup communication channels
KR101120847B1 (en) Data overlay, self-organized metadata overlay, and application level multicasting
CN103098099B (en) Rendering control apparatus and a control method, the mapping server and rendering system
US20090150492A1 (en) Initializing Relationships Between Devices In A Network
KR20040004035A (en) Application catalog on an application server for wireless devices
KR20080068647A (en) Method and system for establishing a service application execution environment in a heterogeneous, distributed computing system and a user friendly data transfer service application executing within the service application execution environment
JP2004503877A5 (en)
JP2003030092A (en) Method and system for accessing information and/or data available on wide area computer network
JP2002024117A (en) Method and system for accessing information on network

Legal Events

Date Code Title Description
C06 Publication
C10 Request of examination as to substance
C02 Deemed withdrawal of patent application after publication (patent law 2001)