CA1257419A - Network event identifiers - Google Patents
Network event identifiersInfo
- Publication number
- CA1257419A CA1257419A CA000532232A CA532232A CA1257419A CA 1257419 A CA1257419 A CA 1257419A CA 000532232 A CA000532232 A CA 000532232A CA 532232 A CA532232 A CA 532232A CA 1257419 A CA1257419 A CA 1257419A
- Authority
- CA
- Canada
- Prior art keywords
- event
- signal
- time
- identifier
- generating
- Prior art date
- Legal status (The legal status 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 status listed.)
- Expired
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M3/00—Automatic or semi-automatic exchanges
- H04M3/22—Arrangements for supervision, monitoring or testing
- H04M3/36—Statistical metering, e.g. recording occasions when traffic exceeds capacity of trunks
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/17—Details of further file system functions
- G06F16/1734—Details of monitoring file system events, e.g. by the use of hooks, filter drivers, logs
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M3/00—Automatic or semi-automatic exchanges
- H04M3/42—Systems providing special services or facilities to subscribers
- H04M3/54—Arrangements for diverting calls for one subscriber to another predetermined subscriber
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q3/00—Selecting arrangements
- H04Q3/42—Circuit arrangements for indirect selecting controlled by common circuits, e.g. register controller, marker
- H04Q3/54—Circuit arrangements for indirect selecting controlled by common circuits, e.g. register controller, marker in which the logic circuitry controlling the exchange is centralised
- H04Q3/545—Circuit arrangements for indirect selecting controlled by common circuits, e.g. register controller, marker in which the logic circuitry controlling the exchange is centralised using a stored programme
- H04Q3/54575—Software application
- H04Q3/54583—Software development, e.g. procedural, object oriented, software generation, software testing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13056—Routines, finite state machines
Abstract
Abstract Identifiers for events occurring at a network node are generated responsive to the time of the event, to a telephone number associated with the node, and to an event characteristic. In a network all of whose nodes use this method, an identifier can be generated at one node without reference to any other node, which will be unique over the network. An identifier generated by this method can be decomposed to recover the time of the event, the telephone number associated with the node at which the event occurred at the time of occurrence, or the event characteristic.
Description
Network event identifiers This invention relates to the operation of data processing nodes connected in a network to comprise a data processing system, and particularly to the generation of identifiers for events such as file creation, for use in the network.
When a file is created at a stand-alone data processing device, in some such devices an identifier is automatically assigned by the device, while in others the user may assign any identifier he chooses to the file (within the device file-naming conventions), so long as the identifier is unique among the identifiers in use at the device. It is usual to provide at the device means for comparing a newly assigned identifier with those already in use, and to reject an identifier that is found to be identical with one in use.
Generally, such means can search only identifiers in current use, not those of files which have been deleted or archived.
It is therefore possible for a file identifier to be used to identify more than one file over a period of time.
When the device is a node in a data processing network, problems in identifying files may arise from several sources.
Nodes in a network may be independently designed devices, each of which has its own local file naming convention. It is difficult to change these conventions after the devices are in use. When such devices are connected in a network, the different conventions introduce difficulties of communication between devices. A plurality of file-naming rules make cross-node file references by file name awkward or even impossible in the general case. ~ecause of this difficulty, if it is necessary to share the data content of,a file across nodes, the file may have to be copied in its entirety, ~5~4~L~
renamed, and stored locally. This is inefficient. Further, if one copy is changed locally, inconsistencies arise between the versions.
Global file naming conventions can solve many of these problems. One method that is used to provide unique file identifiers is to refer to a central catalog or master memory in the system; however, in distributed networks there is no defined "central" location for this name-management facility.
Even if one node is arbitrarily chosen for this purpose, it may not be accessible to all other nodes at all times during their operation.
For example, when the "central" node is temporarily down, the other nodes on the network will be unable to refer to it in order to assign unique Eile identifiers. Alternatively, if a node is temporarily disconnected from the network, it cannot refer to the central node in order to verify a file identifier.
It is therefore desirable to provide a method and means for providing event (such as file creation) identifiers that ensure that each identifier is unique over a network of nodes. It is further desirable that such a method and means be operable entirely within a single node, whether or not the node is connected into the network at the time of the event.
It is an object of the present invention to provide such method and means for generating unique event identifiers that do not require reference or physical link to any shared central naming facility or catalog.
It is a further object of the present invention to provide method and means for generating unique event identifiers providing information about the time and place of the identii:ied event, as we:ll as information about the nature of the event.
~ ccording to a broad aspect of the invention, there is pro-vided in a data processing node, at which successive qualifying events can occur at time intervals no smaller than x, an improvement comprising:
identifier means for generating a unique identif:ier signal for a qualiEy-ing event having a characteristic, comprising storage means, node number means for providing signals representing a predetermined number, and storing said signals in said storage means time signal means for providing time signals indicative of distinctly denominated times, any two successive denominated times being separated by a time interval smaller than x, event signal means responsive to occurrence of one of said qualifying events and to a characteristic of said one event for provlding an event signal, generating means connected to said storage means, said time signal means, and said event signal means and responsive to a said event signal, to said stored node number signals and to said time signals indicative of the one of said denominated times minimally distant from the time of provision of said event signal, for generating an identifier signal associated with said event and indicative of said event characteristic, and for storing said identifier signal in said storage, identifier signal presenting means comprising input/output means and net-work interface means, analysis means responsive to a previously generated event identifier signal presented at said identifier presenting means, comprising first decomposing means for generating node number signals representing . - 3 -41~
7084~-87 the node nilmber stored, at the time o~ occurrence oE the event identif:Led by said presented identif:ier signal, at the node at which said presented event identifier signal was generated, second decomposing means for generating time signals indicative of the denominated time minimally distant from the time of occurrence of the event identified by said presented event ident:i~ier signa~L, and third decomposing means Eor generating event characteristic signals indicative of a characteristic of the event identified by said presented event identifier signal.
These and other objects, features and advantages of the present invention will appear from the following description of a preferred embodiment, together with the drawing, in which ~ i~ - 4 -~5~41 .~
Fig 1 is a schematic showing of a node in which the present invention is practiced.
Referring now to the drawing, a data processing device 10 comprises a central processing unit 12, an internal clock 14, and storage 16. Input/output means conventionally comprising a display 18 and keyboard 20 is provided. A network interface 22, which may be a modem or other appropriate means, connects the device into a network. A telephone terminal 24 is associated with device lO. Terminal 24 may be a handset or other type oE terminal having a unique call number. Terminal 24 need not be physically connected with device 10; its call number is stored in buffer 26 either by being entered through keyboard 20 or in any other convenient way. A real-time clock 28 is associated with device 10; the time shown by this clock is used to provide a fiduciary time for the internal clock 14. This fiduciary time may be entered through keyboard 20 or in any other convenient way.
As is well understood in the art, central processor 12 operates according to an operating system program 30, stored in storage 16, to manage the data processing and other activities of the device.
According to the present invention, an event routine 32 is provided in operating system program 30. Designers of higher level programming for the device select certain events as qualifying events, that is, events for which it is desired to provide an identifier. Such events may be, for example, file creation, keyboard input, or logging on or off.
Provision is made for calling event routine 32 upon occurrence of such a qualifying event. Device 10, under the control of event routine 32, generates an event signal, which desirably represents a characteristic of the event, that is, its type or ~ ~741~t class. Qualifying events are assumed to occur at device lO at time intervals having a minimum size of x seconds.
Clock 14 provides time signals indicative of distinctly denominated times; any two successive denominated times are separated by a time interval smaller than x. Typically, successive denominated times are separated by 1/20 second, of the order of conventional disk access time.
An identifier routine 34 is provided in operating system 30. This routine responds to the event signal by referring to the call number buffer 26 and to clock 14, and generates responsive to the event signal, to the stored call number signals and to the time signals from clock 14, an identifier signal associated with the event. This identifier signal is stored, for example in file index 40 (in storage 16) or wherever a file identifier is conventionally used.
The identifier is desirably in the form of a Node field 42, comprising signals representing the call number from buffer 26, a Time field 44, comprising time signals from clock 14 indicative of a denominated time most closely associated with the time of the event signal, and a Type field 46, comprising signals indicative of the type of event (event characteristic). These signals may be packed or concatenated in any convenient way.
I estimate that an identifier format comprising 16 bytes is adequate to conveniently and unambiguously describe at least lO00 events per second at each phone number in the world for at least the next 1000 years. File catalog systems on most current computer systems support file names of at least 16 bytes, so the identifier generated according to the present invention can be adopted within the framework of most existing ~57~
file naming and cataloging methods. In a network of nodes in which my invention is employed, a file identifier generated according to my invention is unique among all identifiers generated in the network at any time, not merely among those catalogued or indexed at the time of generation. Thus even archived and deleted files remain uniquely identified.
An identifier generated according to the present invention can be used by any node in the system, which can therefore access the identified file without further information iE the nodes are connected through the global telephone network.
Events or objects other than file creation that may desirably be identified according to my invention are creation or change of any network node, a hardware component in the node, the person or organization typically using the node, or transient data structures.
According to a further aspect of my invention, an identifier generated according to my invention can be analyzed to derive information that is useful in accessing the identified file or otherwise. For this purpose, three decomposition routines are provided in operating system 30.
Decomposition routine 50 generates, in response to a provided identifier generated as described above, the call number of the telephone terminal that was associated, at the time of the event, with the node where the event occurred. This information is useful, if the identified file has been archived but is no longer stored in the node; a telephone call to the derived call number is likely to reach an operator who can provide the identified file. Furthermore, call forwarding information can be provided at the node if the associated telephone terminal has been changed. Decomposition routine 52 generates, in response to a provided identifier generated as described above, the denominated time closest to the time when 74~.~3 the event occurred. This information is frequently desired by users of data processing devices. Finally, decomposition routine 54 generates, in response to a provided identifier generated as described above, signals representing the characteristic or type of the event. This information is useful in the internal operation of the device; for example, a program branch~can be conditioned on the event characteristic.
What is claimed is:
When a file is created at a stand-alone data processing device, in some such devices an identifier is automatically assigned by the device, while in others the user may assign any identifier he chooses to the file (within the device file-naming conventions), so long as the identifier is unique among the identifiers in use at the device. It is usual to provide at the device means for comparing a newly assigned identifier with those already in use, and to reject an identifier that is found to be identical with one in use.
Generally, such means can search only identifiers in current use, not those of files which have been deleted or archived.
It is therefore possible for a file identifier to be used to identify more than one file over a period of time.
When the device is a node in a data processing network, problems in identifying files may arise from several sources.
Nodes in a network may be independently designed devices, each of which has its own local file naming convention. It is difficult to change these conventions after the devices are in use. When such devices are connected in a network, the different conventions introduce difficulties of communication between devices. A plurality of file-naming rules make cross-node file references by file name awkward or even impossible in the general case. ~ecause of this difficulty, if it is necessary to share the data content of,a file across nodes, the file may have to be copied in its entirety, ~5~4~L~
renamed, and stored locally. This is inefficient. Further, if one copy is changed locally, inconsistencies arise between the versions.
Global file naming conventions can solve many of these problems. One method that is used to provide unique file identifiers is to refer to a central catalog or master memory in the system; however, in distributed networks there is no defined "central" location for this name-management facility.
Even if one node is arbitrarily chosen for this purpose, it may not be accessible to all other nodes at all times during their operation.
For example, when the "central" node is temporarily down, the other nodes on the network will be unable to refer to it in order to assign unique Eile identifiers. Alternatively, if a node is temporarily disconnected from the network, it cannot refer to the central node in order to verify a file identifier.
It is therefore desirable to provide a method and means for providing event (such as file creation) identifiers that ensure that each identifier is unique over a network of nodes. It is further desirable that such a method and means be operable entirely within a single node, whether or not the node is connected into the network at the time of the event.
It is an object of the present invention to provide such method and means for generating unique event identifiers that do not require reference or physical link to any shared central naming facility or catalog.
It is a further object of the present invention to provide method and means for generating unique event identifiers providing information about the time and place of the identii:ied event, as we:ll as information about the nature of the event.
~ ccording to a broad aspect of the invention, there is pro-vided in a data processing node, at which successive qualifying events can occur at time intervals no smaller than x, an improvement comprising:
identifier means for generating a unique identif:ier signal for a qualiEy-ing event having a characteristic, comprising storage means, node number means for providing signals representing a predetermined number, and storing said signals in said storage means time signal means for providing time signals indicative of distinctly denominated times, any two successive denominated times being separated by a time interval smaller than x, event signal means responsive to occurrence of one of said qualifying events and to a characteristic of said one event for provlding an event signal, generating means connected to said storage means, said time signal means, and said event signal means and responsive to a said event signal, to said stored node number signals and to said time signals indicative of the one of said denominated times minimally distant from the time of provision of said event signal, for generating an identifier signal associated with said event and indicative of said event characteristic, and for storing said identifier signal in said storage, identifier signal presenting means comprising input/output means and net-work interface means, analysis means responsive to a previously generated event identifier signal presented at said identifier presenting means, comprising first decomposing means for generating node number signals representing . - 3 -41~
7084~-87 the node nilmber stored, at the time o~ occurrence oE the event identif:Led by said presented identif:ier signal, at the node at which said presented event identifier signal was generated, second decomposing means for generating time signals indicative of the denominated time minimally distant from the time of occurrence of the event identified by said presented event ident:i~ier signa~L, and third decomposing means Eor generating event characteristic signals indicative of a characteristic of the event identified by said presented event identifier signal.
These and other objects, features and advantages of the present invention will appear from the following description of a preferred embodiment, together with the drawing, in which ~ i~ - 4 -~5~41 .~
Fig 1 is a schematic showing of a node in which the present invention is practiced.
Referring now to the drawing, a data processing device 10 comprises a central processing unit 12, an internal clock 14, and storage 16. Input/output means conventionally comprising a display 18 and keyboard 20 is provided. A network interface 22, which may be a modem or other appropriate means, connects the device into a network. A telephone terminal 24 is associated with device lO. Terminal 24 may be a handset or other type oE terminal having a unique call number. Terminal 24 need not be physically connected with device 10; its call number is stored in buffer 26 either by being entered through keyboard 20 or in any other convenient way. A real-time clock 28 is associated with device 10; the time shown by this clock is used to provide a fiduciary time for the internal clock 14. This fiduciary time may be entered through keyboard 20 or in any other convenient way.
As is well understood in the art, central processor 12 operates according to an operating system program 30, stored in storage 16, to manage the data processing and other activities of the device.
According to the present invention, an event routine 32 is provided in operating system program 30. Designers of higher level programming for the device select certain events as qualifying events, that is, events for which it is desired to provide an identifier. Such events may be, for example, file creation, keyboard input, or logging on or off.
Provision is made for calling event routine 32 upon occurrence of such a qualifying event. Device 10, under the control of event routine 32, generates an event signal, which desirably represents a characteristic of the event, that is, its type or ~ ~741~t class. Qualifying events are assumed to occur at device lO at time intervals having a minimum size of x seconds.
Clock 14 provides time signals indicative of distinctly denominated times; any two successive denominated times are separated by a time interval smaller than x. Typically, successive denominated times are separated by 1/20 second, of the order of conventional disk access time.
An identifier routine 34 is provided in operating system 30. This routine responds to the event signal by referring to the call number buffer 26 and to clock 14, and generates responsive to the event signal, to the stored call number signals and to the time signals from clock 14, an identifier signal associated with the event. This identifier signal is stored, for example in file index 40 (in storage 16) or wherever a file identifier is conventionally used.
The identifier is desirably in the form of a Node field 42, comprising signals representing the call number from buffer 26, a Time field 44, comprising time signals from clock 14 indicative of a denominated time most closely associated with the time of the event signal, and a Type field 46, comprising signals indicative of the type of event (event characteristic). These signals may be packed or concatenated in any convenient way.
I estimate that an identifier format comprising 16 bytes is adequate to conveniently and unambiguously describe at least lO00 events per second at each phone number in the world for at least the next 1000 years. File catalog systems on most current computer systems support file names of at least 16 bytes, so the identifier generated according to the present invention can be adopted within the framework of most existing ~57~
file naming and cataloging methods. In a network of nodes in which my invention is employed, a file identifier generated according to my invention is unique among all identifiers generated in the network at any time, not merely among those catalogued or indexed at the time of generation. Thus even archived and deleted files remain uniquely identified.
An identifier generated according to the present invention can be used by any node in the system, which can therefore access the identified file without further information iE the nodes are connected through the global telephone network.
Events or objects other than file creation that may desirably be identified according to my invention are creation or change of any network node, a hardware component in the node, the person or organization typically using the node, or transient data structures.
According to a further aspect of my invention, an identifier generated according to my invention can be analyzed to derive information that is useful in accessing the identified file or otherwise. For this purpose, three decomposition routines are provided in operating system 30.
Decomposition routine 50 generates, in response to a provided identifier generated as described above, the call number of the telephone terminal that was associated, at the time of the event, with the node where the event occurred. This information is useful, if the identified file has been archived but is no longer stored in the node; a telephone call to the derived call number is likely to reach an operator who can provide the identified file. Furthermore, call forwarding information can be provided at the node if the associated telephone terminal has been changed. Decomposition routine 52 generates, in response to a provided identifier generated as described above, the denominated time closest to the time when 74~.~3 the event occurred. This information is frequently desired by users of data processing devices. Finally, decomposition routine 54 generates, in response to a provided identifier generated as described above, signals representing the characteristic or type of the event. This information is useful in the internal operation of the device; for example, a program branch~can be conditioned on the event characteristic.
What is claimed is:
Claims (3)
PROPERTY OR PRIVILEGE IS CLAIMED ARE DEFINED AS FOLLOWS:
1. In a data processing node, at which successive qualifying events can occur at time intervals no smaller than x, an improvement comprising:
identifier means for generating a unique identifier signal for a qualify-ing event having a characteristic, comprising storage means, node number means for providing signals representing a predetermined number, and storing said signals in said storage means time signal means for providing time signals indicative of distinctly denominated times, any two successive denominated times being separated by a time interval smaller than x, event signal means responsive to occurrence of one of said qualifying events and to a characteristic of said one event for providing an event signal, generating means connected to said storage means, said time signal means, and said event signal means and responsive to a said event signal, to said stored node number signals and to said time signals indicative of the one of said denominated times minimally distant from the time of provision of said event signal, for generating an identifier signal associated with said event and indicative of said event characteristic, and for storing said identifier signal in said storage, identifier signal presenting means comprising input/output means and net-work interface means, analysis means responsive to a previously generated event identifier signal presented at said identifier presenting means, comprising first decomposing means for generating node number signals representing the node number stored, at the time of occurrence of the event identified by said presented identifier signal, at the node at which said presented event identifier signal was generated, second decomposing means for generating time signals indicative of the denominated time minimally distant from the time of occurrence of the event identified by said presented event identifier signal, and third decomposing means for generating event characteristic signals indicative of a characteristic of the event identified by said presented event identifier signal.
identifier means for generating a unique identifier signal for a qualify-ing event having a characteristic, comprising storage means, node number means for providing signals representing a predetermined number, and storing said signals in said storage means time signal means for providing time signals indicative of distinctly denominated times, any two successive denominated times being separated by a time interval smaller than x, event signal means responsive to occurrence of one of said qualifying events and to a characteristic of said one event for providing an event signal, generating means connected to said storage means, said time signal means, and said event signal means and responsive to a said event signal, to said stored node number signals and to said time signals indicative of the one of said denominated times minimally distant from the time of provision of said event signal, for generating an identifier signal associated with said event and indicative of said event characteristic, and for storing said identifier signal in said storage, identifier signal presenting means comprising input/output means and net-work interface means, analysis means responsive to a previously generated event identifier signal presented at said identifier presenting means, comprising first decomposing means for generating node number signals representing the node number stored, at the time of occurrence of the event identified by said presented identifier signal, at the node at which said presented event identifier signal was generated, second decomposing means for generating time signals indicative of the denominated time minimally distant from the time of occurrence of the event identified by said presented event identifier signal, and third decomposing means for generating event characteristic signals indicative of a characteristic of the event identified by said presented event identifier signal.
2. In a network of data processing nodes, at each of which successive qualifying events can occur at time intervals no smaller than x, an improvement comprising:
at each said node, identifier means for generating a unique identifier signal for a qualifying event having a characteristic, comprising storage means, node number means for providing signal representing a predetermined number, and storing said signals in said storage means, time signal means for providing time signals indicative of distinctly denominated times, any two successive denominated times being separated by a time interval smaller than x, event signal means responsive to occurrence of one of said qualifying events and to a characteristic of said one event for providing an event signal, generating means connected to said storage means, said time signal means, and said event signal means and responsive to a said event signal, to said stored node number signals and to said time signals indicative of the one of said denominated times minimally distant from the time of provision of said event signal, for generating an identifier signal associated with said event and indicative of said event characteristic, and for storing said identifier signal in said storage, and in at least one said node, identifier signal presenting means, comprising input/output means and network interface means, for presenting a previously generated identifier signal, and analysis means for decomposing a said identifier signal presented at said identifier presenting means, comprising first decomposing means for generating node number signals stored, at the time of occurrence of the event identified by said presented identifier signal, at the node at which said presented event identifier signal was generated, second decomposing means for generating time signals indicative of the denominated time minimally distant from the time of occurrence of the event identified by said presented event identifier signal, and third decomposing means for generating event characteristic signals indicative of a characteristic of the event identified by said presented event identifier signal.
at each said node, identifier means for generating a unique identifier signal for a qualifying event having a characteristic, comprising storage means, node number means for providing signal representing a predetermined number, and storing said signals in said storage means, time signal means for providing time signals indicative of distinctly denominated times, any two successive denominated times being separated by a time interval smaller than x, event signal means responsive to occurrence of one of said qualifying events and to a characteristic of said one event for providing an event signal, generating means connected to said storage means, said time signal means, and said event signal means and responsive to a said event signal, to said stored node number signals and to said time signals indicative of the one of said denominated times minimally distant from the time of provision of said event signal, for generating an identifier signal associated with said event and indicative of said event characteristic, and for storing said identifier signal in said storage, and in at least one said node, identifier signal presenting means, comprising input/output means and network interface means, for presenting a previously generated identifier signal, and analysis means for decomposing a said identifier signal presented at said identifier presenting means, comprising first decomposing means for generating node number signals stored, at the time of occurrence of the event identified by said presented identifier signal, at the node at which said presented event identifier signal was generated, second decomposing means for generating time signals indicative of the denominated time minimally distant from the time of occurrence of the event identified by said presented event identifier signal, and third decomposing means for generating event characteristic signals indicative of a characteristic of the event identified by said presented event identifier signal.
3. The improvement of claim 1, further comprising fiduciary time means for relating said time signals to a real time standard.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US841,070 | 1986-03-18 | ||
| US06/841,070 US4792921A (en) | 1986-03-18 | 1986-03-18 | Network event identifiers |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA1257419A true CA1257419A (en) | 1989-07-11 |
Family
ID=25283943
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA000532232A Expired CA1257419A (en) | 1986-03-18 | 1987-03-17 | Network event identifiers |
Country Status (6)
| Country | Link |
|---|---|
| US (1) | US4792921A (en) |
| EP (1) | EP0238039B2 (en) |
| JP (1) | JPH0797347B2 (en) |
| AU (1) | AU591551B2 (en) |
| CA (1) | CA1257419A (en) |
| DE (1) | DE3782349T3 (en) |
Families Citing this family (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5117351A (en) * | 1988-10-21 | 1992-05-26 | Digital Equipment Corporation | Object identifier generator for distributed computer system |
| US5155850A (en) * | 1990-02-23 | 1992-10-13 | International Business Machines Corporation | Method and system for maintaining a time frame selective document history log in a data processing system |
| US5202982A (en) * | 1990-03-27 | 1993-04-13 | Sun Microsystems, Inc. | Method and apparatus for the naming of database component files to avoid duplication of files |
| US5627996A (en) * | 1992-08-19 | 1997-05-06 | At&T | Method and apparatus for accessing the same computer file using different file name formats |
| US5522077A (en) * | 1994-05-19 | 1996-05-28 | Ontos, Inc. | Object oriented network system for allocating ranges of globally unique object identifiers from a server process to client processes which release unused identifiers |
| US5884322A (en) * | 1994-05-24 | 1999-03-16 | Apple Computer, Inc. | Method and apparatus for creating and assigning unique identifiers for network entities and database items in a networked computer system |
| DE19524405C2 (en) * | 1995-07-04 | 1997-10-02 | Siemens Ag | Call data acquisition procedure |
| US6108637A (en) | 1996-09-03 | 2000-08-22 | Nielsen Media Research, Inc. | Content display monitor |
| US6643696B2 (en) | 1997-03-21 | 2003-11-04 | Owen Davis | Method and apparatus for tracking client interaction with a network resource and creating client profiles and resource database |
| JP3555088B2 (en) * | 1997-03-24 | 2004-08-18 | ジェーシーエヌ株式会社 | Authentication data issuing system and authentication data authentication system based on specific time |
| US6553403B1 (en) | 1998-06-03 | 2003-04-22 | International Business Machines Corporation | System, method and computer program product for monitoring in a distributed computing environment |
| AUPQ206399A0 (en) | 1999-08-06 | 1999-08-26 | Imr Worldwide Pty Ltd. | Network user measurement system and method |
| US8661111B1 (en) | 2000-01-12 | 2014-02-25 | The Nielsen Company (Us), Llc | System and method for estimating prevalence of digital content on the world-wide-web |
| US6542907B1 (en) | 2000-03-31 | 2003-04-01 | International Business Machines Corporation | Method and apparatus for decentralized, invertible generation of bounded-length globally unique replica identifiers |
| WO2003053007A1 (en) * | 2001-12-17 | 2003-06-26 | Sony Corporation | Data communication system, data communication apparatus, and data communication method |
| US8271778B1 (en) | 2002-07-24 | 2012-09-18 | The Nielsen Company (Us), Llc | System and method for monitoring secure data on a network |
| AU2008260397B2 (en) * | 2007-05-31 | 2012-08-16 | The Nielsen Company (Us), Llc | Methods and apparatus to model set-top box data |
| US9219928B2 (en) | 2013-06-25 | 2015-12-22 | The Nielsen Company (Us), Llc | Methods and apparatus to characterize households with media meter data |
| US9277265B2 (en) | 2014-02-11 | 2016-03-01 | The Nielsen Company (Us), Llc | Methods and apparatus to calculate video-on-demand and dynamically inserted advertisement viewing probability |
| US10219039B2 (en) | 2015-03-09 | 2019-02-26 | The Nielsen Company (Us), Llc | Methods and apparatus to assign viewers to media meter data |
| US9848224B2 (en) | 2015-08-27 | 2017-12-19 | The Nielsen Company(Us), Llc | Methods and apparatus to estimate demographics of a household |
| US10791355B2 (en) | 2016-12-20 | 2020-09-29 | The Nielsen Company (Us), Llc | Methods and apparatus to determine probabilistic media viewing metrics |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4559416A (en) * | 1983-10-12 | 1985-12-17 | Morgan Industries, Inc. | Telephone line activity monitor |
| US4558413A (en) * | 1983-11-21 | 1985-12-10 | Xerox Corporation | Software version management system |
-
1986
- 1986-03-18 US US06/841,070 patent/US4792921A/en not_active Expired - Lifetime
- 1986-12-12 JP JP61296497A patent/JPH0797347B2/en not_active Expired - Lifetime
-
1987
- 1987-03-17 EP EP87103838A patent/EP0238039B2/en not_active Expired - Lifetime
- 1987-03-17 CA CA000532232A patent/CA1257419A/en not_active Expired
- 1987-03-17 DE DE3782349T patent/DE3782349T3/en not_active Expired - Fee Related
- 1987-03-17 AU AU70090/87A patent/AU591551B2/en not_active Ceased
Also Published As
| Publication number | Publication date |
|---|---|
| DE3782349T2 (en) | 1993-05-19 |
| EP0238039A2 (en) | 1987-09-23 |
| DE3782349D1 (en) | 1992-12-03 |
| JPS62221246A (en) | 1987-09-29 |
| AU591551B2 (en) | 1989-12-07 |
| AU7009087A (en) | 1987-09-24 |
| US4792921A (en) | 1988-12-20 |
| JPH0797347B2 (en) | 1995-10-18 |
| EP0238039A3 (en) | 1989-05-31 |
| EP0238039B1 (en) | 1992-10-28 |
| EP0238039B2 (en) | 1997-04-16 |
| DE3782349T3 (en) | 1997-10-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA1257419A (en) | Network event identifiers | |
| KR100628426B1 (en) | System and method for selectively defining accesss to application features | |
| US5345586A (en) | Method and system for manipulation of distributed heterogeneous data in a data processing system | |
| US5884310A (en) | Distributed data integration method and system | |
| US8819084B2 (en) | Service desk data transfer interface | |
| US5920867A (en) | Data management system having data management configuration | |
| EP0744055B1 (en) | Distributed data base system | |
| EP0126121A1 (en) | Hyperedge entity-relationship data base systems | |
| JP2901081B2 (en) | How to rename non-leaf entries in OSI directory | |
| EP1046118A2 (en) | Method and system for generating corporate information | |
| CN111427491A (en) | Method and device for configuring system background menu button | |
| CN111324604A (en) | Database table processing method and device, electronic equipment and storage medium | |
| US6675157B1 (en) | System and method for balancing binary search trees | |
| CN106844497A (en) | The check device and method of a kind of database code | |
| EP0394172A3 (en) | Method of performing file services given partial file names | |
| JPH096663A (en) | Distributed link information maintenance method | |
| AU2003200813B2 (en) | System and method for selectively defining access to application features | |
| Cheng | Design considerations for distributed data bases in computer networks. | |
| KR19980043212A (en) | Method of generating relation-domain-information data of mobile switching center | |
| CN115630344A (en) | Authority authentication and data processing method, database and system | |
| JPH11224215A (en) | File management method/device | |
| MXPA01000614A (en) | System and method for selectively defining access to application features | |
| JPH09274590A (en) | Data processor | |
| Haas | The Computer Aided Management of an Off-Line Magnetic Tape Storage Facility Utilizing a Data Base Management System | |
| JPH08137843A (en) | Different document sharing system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| MKEX | Expiry |