Controlling access to data in a data processing system
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
H04L-029/06
G06F-021/00
출원번호
UP-0980687
(2007-10-31)
등록번호
US-7802310
(2010-10-11)
발명자
/ 주소
Farber, David A.
Lachman, Ronald D.
출원인 / 주소
Kinetech, Inc.
Level 3 Communications, LLC
대리인 / 주소
Davidson Berquist Jackson & Gowdey, LLP
인용정보
피인용 횟수 :
28인용 특허 :
137
초록▼
Access to and delivery of licensed content is controlled using content names that were determined based on the content. A name for a data item is obtained, the name having been determined based at least in part on the data which comprise the contents of the data item. Access to the data item is auth
Access to and delivery of licensed content is controlled using content names that were determined based on the content. A name for a data item is obtained, the name having been determined based at least in part on the data which comprise the contents of the data item. Access to the data item is authorized based at least in part on the name. Once authorized, access may be granted from more than one computer. The name may have been determined using a hash or message digest function such as MD4, MD5 or SHA. The data item may comprise a file, a portion of a file, a page in memory, a digital message, a digital image, a video signal or an audio signal.
대표청구항▼
We claim: 1. A computer-implemented method in a system which includes a network of computers, the method implemented at least in part by hardware comprising at least one processor, the method comprising the steps: (a) at a first computer, obtaining a content-based name for a particular data item fr
We claim: 1. A computer-implemented method in a system which includes a network of computers, the method implemented at least in part by hardware comprising at least one processor, the method comprising the steps: (a) at a first computer, obtaining a content-based name for a particular data item from a second computer distinct from the first computer, the content-based name being based at least in part on a function of at least some of the data which comprise the contents of the particular data item, wherein the function comprises a message digest function or a hash function, and wherein two identical data items will have the same content-based name; and (b) by hardware in combination with software, a processor at said first computer ascertaining whether or not the content-based name for the particular data item corresponds to an entry in a database comprising a plurality of identifiers; and (c) based at least in part on said ascertaining in (b), determining whether or not access to the particular data item is authorized. 2. A method as recited in claim 1 further comprising: (d) based at least in part on said determining in (c), causing access to the particular data item to be denied when it is determined that access to the particular data item is not authorized. 3. A method as recited in claim 1 wherein the content-based name for the particular data item was included in a request to access the particular data item, the request having been received from a particular requestor, and wherein said step (c) of determining comprises: determining whether or not the particular requestor is authorized. 4. A method as recited in claim 3 further comprising: if it is determined that the particular requestor is not authorized, causing the particular requestor's request to access the particular data item to be denied. 5. A method as recited in claim 1 wherein said database comprises a table or a list comprising said plurality of identifiers. 6. A method as recited in claim 1 wherein the plurality of identifiers in the database are identifiers of licensed content items, and wherein the identifier of each licensed content item is based at least in part on the function of at least some of the data comprising the licensed content item. 7. A method as recited in claim 1 further comprising: (d) collecting information regarding the particular data item. 8. A method as recited in claim 7, wherein the information collected includes at least one of: (a) information about which data items have been stored on a computer; (b) information about the content of the particular data item, (c) information about an owner of the particular data item, (d) information about a type of particular data item, (e) information about a contextual name of the particular data item, (f) information about whether the particular data item was copied; (g) the content-based name of the particular data item; (h) information about an identity of a requestor; (i) a timestamp; (j) information about whether the particular data item was created; and (k) information about whether the particular data item was read. 9. A method as recited in claim 7 wherein at least some of the information collected is maintained for accounting or billing purposes. 10. A method as recited in claim 1 further comprising: (d) tracking identities of data items. 11. A method as recited in claim 1 wherein the content-based name of the particular data item is based, at least in part, on a function of all of the data which comprise the contents of the particular data item. 12. A method as recited in claim 1 wherein the message digest function or hash function is selected from the functions: MD4, MD5, and SHA. 13. A method as recited in claim 1 wherein the content-based name of the particular data item is a True Name of the particular data item. 14. A method as recited in claim 1 wherein the particular data item is selected from the group comprising: a file, a portion of a file, a page in memory, a digital message, a portion of a digital message, a digital image, a portion of a digital image, a video signal, a portion of a video signal, an audio signal, a portion of an audio signal, a software product, and a portion of a software product. 15. A method as recited in claim 1 wherein at least some computers make up part of a peer-to-peer network of computers. 16. A method as recited in claim 1 further comprising: (d) authorizing access to the particular data item when it is not determined that the data item is unauthorized. 17. A method as recited in claim 16 wherein the authorized access permits copying of the particular data item to or from at least one of the computers in said network of computers. 18. A method as recited in claim 16 wherein the content-based name of the particular data item is received at the first computer and wherein, if it is not determined that said particular data item is unauthorized, access to the data item is permitted from at least one of a plurality of computers distinct from the first computer. 19. A method as recited in claim 16 wherein, if it is not determined that access to said particular data item is unauthorized, access to the data item is permitted from more than one of a plurality of computers in the network of computers. 20. A computer-implemented method operable in a system which includes a plurality of computers, the method comprising: controlling distribution of content from a first computer to at least one other computer, in response to a request obtained by a first device in the system from a second device in the system, the first device comprising hardware including at least one processor, the request including at least a content-dependent name of a particular data item, the content-dependent name being based at least in part on a function of at least some of the data comprising the particular data item, wherein the function comprises a message digest function or a hash function, and wherein two identical data items will have the same content-dependent name, based at least in part on said content-dependent name of said particular data item, the first device (A) permitting the content to be provided to or accessed by the at least one other computer if it is not determined that the content is unauthorized or unlicensed, otherwise, (B) if it is determined that the content is unauthorized or unlicensed, not permitting the content to be provided to or accessed by the at least one other computer. 21. A computer-implemented method implemented at least in part by hardware comprising one or more processors, the method comprising: (a) obtaining a list of content-dependent names, one for each of a plurality of data items, wherein, for each particular data item of the plurality of data items, the corresponding content-dependent name for that particular data item is based at least in part on a function of at least some of the contents of the particular data item, wherein the function comprises a message digest function or a hash function, and wherein two identical data items have the same content-dependent name on the list of content-dependent names; (b) receiving at a first location, and from a second location distinct from said first location, a content-dependent identifier corresponding to a particular data item, said content-dependent identifier being based at least in part on at least some of the contents of the particular data item; (c) at said first location, by a processor, in combination with software, determining, based at least in part on said content-dependent identifier for said particular data item, and using said list of content-dependent names, whether a requestor may access the particular data item; and (d) based on said determining in (c), if it is determined that the requestor may not access the particular data item, causing access to the particular data item to be denied. 22. A method as recited in claim 21 wherein the list of content-dependent names comprises a list of True Names of authorized data items and wherein the content-dependent identifier of the particular data item is a True Name of the particular data item. 23. A method as recited in claim 21 wherein at least some of said computers make up part of a peer-to-peer network of computers. 24. A computer-implemented method implemented at least in part by hardware comprising one or more processors, the method comprising: (a) using a processor, receiving at a first computer from a second computer, a request regarding a particular data item, said request including at least a content-dependent name for the particular data item, the content-dependent name being based, at least in part, on at least a function of the data in the particular data item, wherein the data used by the function to determine the content-dependent name comprises at least some of the contents of the particular data item, wherein the function that was used comprises a message digest function or a hash function, and wherein two identical data items will have the same content-dependent name; and (b) in response to said request: (i) causing the content-dependent name of the particular data item to be compared to a plurality of values; (ii) hardware in combination with software determining whether or not access to the particular data item is unauthorized based on whether the content-dependent name of the particular data item corresponds to at least one of said plurality of values, and (iii) based on said determining in step (ii), not allowing the particular data item to be provided to or accessed by the second computer if it is determined that access to the particular data item is not authorized. 25. A method as recited in claim 24 further comprising: in response to said request: (iv) allowing the particular data item to be provided to or accessed by the second computer if it is not determined that access to the particular data item is unauthorized. 26. The method of claim 1 wherein the content-based name of the particular data item is based on a function of only the data which comprise the contents of the particular data item. 27. The method of claim 20 wherein the content-dependent name of the particular data item is based on a function of only the data comprising the particular data item. 28. The method of claim 21 wherein, for each particular data item of the plurality of data items, the corresponding content-dependent name for that particular data item was determined as a function of only the contents of that particular data item. 29. The method of claim 24 wherein the data used by the function to determine the content-dependent name of the particular data item comprises only the contents of the particular data item. 30. The method of claim 20 wherein the content-dependent name of the particular data item is based on a function of all of the data comprising the particular data item. 31. The method of claim 21 wherein, for each particular data item of the plurality of data items, the corresponding content-dependent name for that particular data item was based on a function of all of the contents of that particular data item. 32. The method of claim 24 wherein the data used by the function to determine the content-dependent name of the particular data item comprises of all of the contents of the particular data item. 33. The method of claim 1 wherein the hardware comprises a processor and memory. 34. The method of claim 20 wherein the hardware comprises a processor and memory. 35. The method of claim 21 wherein the hardware comprises a processor and memory. 36. The method of claim 24 wherein the hardware comprises a processor and memory. 37. The method of claim 1 wherein the hardware comprises a computer. 38. The method of claim 20 wherein the hardware comprises a computer. 39. The method of claim 21 wherein the hardware comprises a computer. 40. The method of claim 24 wherein the hardware comprises a computer. 41. The method of claim 1 wherein said content-based name for said particular data item was obtained as part of a request to allow providing of the particular data item to one or more computers in the network of computers, and wherein the determining in (c) whether or not access to the particular data item is authorized comprises: using at least the content-based name of the particular data item and information in the database to determine whether or not to allow the particular data item to be provided to computers in the network of computers. 42. The method of claim 41 further comprising: (d) based at least in part on said determining in (c), causing permission to provide the particular data item to computers to be denied when it is determined that access to the particular data item is not authorized. 43. The method as in claim 1 wherein: the function comprises a message digest function or a hash function applied to at least some of the data in the particular data item to obtain a digital fingerprint of the particular data item. 44. The method of claim 1 wherein the content-based name for the particular data item comprises a digital fingerprint of the particular data item, and wherein each of the plurality of identifiers in the database comprises a digital fingerprint of the corresponding data item. 45. The method of claim 1 wherein, when the particular data item comprises a file or a portion of a file comprising an audio signal, the content-based name of the particular data item is a function of at least some of the data comprising the audio signal. 46. The method as in claim 1 wherein, when the particular data item comprises a file or a portion of a file comprising a video signal, the content-based name of the particular data item is a function of at least some of the data comprising the video signal. 47. A method as recited in claim 1 wherein, when it is not determined in step (c) that access to said particular data item is unauthorized, providing of the particular data item is permitted to or from one or more computers in the network of computers. 48. A method as recited in claim 16 wherein the authorizing access to the particular data item authorizes providing the particular data item to or from one or more computers in the network of computers. 49. The method of claim 21 wherein determining in (c) whether the requestor may access the particular data item comprises: using at least the content-dependent identifier of the particular data item and the list of content-dependent names to determine whether or not the requestor is authorized to allow copying of the particular data item. 50. The method of claim 1 wherein determining whether or not access to the particular data item is authorized comprises determining whether or not access to the particular data item is not unauthorized. 51. The method of claim 1 wherein the content-based name for the particular data item corresponds to an entry in the database when the content-based name for the particular data item matches one of the plurality of identifiers in the database. 52. The method of claim 1 wherein said database maps each identifier of said plurality of identifiers in said database to information relating to a corresponding data item. 53. A method as recited in claim 1 further comprising: (d) permitting at least one copy of the particular data item to be distributed to or from at least one computer in the network when it is determined that the particular data item is not unauthorized. 54. The method of claim 1 further comprising: (d) based at least in part on said determining in (c), causing denial of permission for at least one copy of the particular file to be distributed across the plurality of computers in a network when it is determined that the file is not authorized. 55. The method of claim 1 further comprising the step: (i) by hardware in combination with software, determining said content-based name for said particular data item. 56. The method of claim 55 further comprising: obtaining a copy of the particular data item, and wherein the step (i) determines the content-based name using the copy of the particular data item. 57. The method of claim 1 further comprising: obtaining the database. 58. The method of claim 1 wherein the content-based name for said particular data item is based, at least in part, on a size or length of the particular data item. 59. The method of claim 51 wherein the content-based name for the particular data item corresponds to an entry in the database when the content-based name for the particular data item exactly matches one of the plurality of identifiers in the database. 60. The method of claim 1 wherein the database comprises a table or a list identifying data items which may only be used by licensed users. 61. The method of claim 1 wherein the database comprises a table identifying license information associated with data items, and wherein the table is indexed at least by the identifiers of data items. 62. The method of claim 1 wherein, wherein the database comprises a table containing a plurality of records, and wherein a record of the table records a relationship between a specific data item and users licensed to have access to that specific data item. 63. The method of claim 1, wherein the plurality of identifiers in the database are identifiers of licensed content items. 64. The method of claim 5 wherein the table or list identifies conditions under which certain data items may be used. 65. A method as recited in claim 1 wherein access to said data item comprises one or more of: (a) copying the data item to or from at least one of a plurality of computers; (b) providing the data item to at least one of a plurality of computers; (c) reading the data item; (d) copying the data item; (e) distributing the data item; (f) modifying the data item; (g) storing the data item; (h) opening the data item; (i) publishing the data item; (j) writing the data item; (k) moving the data item; and (1) deleting the data item. 66. A system operable in a network of computers, the system comprising hardware including at least one processor to: (a) obtain at a first computer, from a second computer distinct from said first computer, a content-based name for a particular data item, the content-based name being based at least in part on a function of at least some of the data which comprise the contents of the particular data item, wherein the function comprises a message digest function or a hash function, and wherein two identical data items will have the same content-based name; and to (b) ascertain whether or not the content-based name for the particular data item corresponds to an entry in a database comprising a plurality of identifiers; and to (c) determine, based at least in part on whether or not the particular data item corresponds to an entry in a database, whether or not access to the data item is unauthorized at or by one or more computers distinct from the first computer. 67. A system operable in a network of computers, the system comprising hardware including at least one processor to: control distribution of content from a first computer in said network, at a first computer, in response to a request from a second computer distinct from the first computer, the request including at least a content-dependent name of a particular data item, the content-dependent name being based at least in part on a function of at least some of the data comprising the particular data item, wherein the function comprises a message digest function or a hash function, and wherein two identical data items will have the same content-dependent name, and to based at least in part on said content-dependent name of said particular data item, selectively permit the content to be provided to or from at least one other computer if providing of the content is not determined to unauthorized or unlicensed. 68. A device operable in a network of computers, the device comprising hardware including at least one processor, and software, in combination with said hardware: (a) to obtain a list of content-dependent names, one content-dependent name for each of a plurality of data items, wherein, for each of the plurality of data items, the corresponding content-dependent name for that data item is based at least in part on a function of at least some of the contents of that data item, wherein the function is a message digest function or a hash function, and wherein two identical data items have the same content-dependent name; (b) to receive at a first location, from a second location distinct from said first location, an identifier for a particular data item; (c) to determine, based at least in part on said identifier for said particular data item, and using said list of content-dependent names, whether a requestor may access the particular data item; and (d) based at least in part on said determining, if it is determined that requestor may not access the particular data item, to cause access to the particular data item to be denied. 69. A system operable in a network of computers, the system comprising hardware including at least a processor, and software, in combination with said hardware: (a) to receive at a first computer, from a second computer, a request regarding a data item, said request including at least a content-dependent name for the data item, the content-dependent name being based at least in part on a function of the data in the data item, wherein the data used by the function to determine the content-dependent name comprises at least some of the contents of the data item, wherein the function that was used is a message digest function or a hash function, and wherein two identical data items will have the same content-dependent name; and (b) in response to said request: (i) to cause the content-dependent name of the data item to be compared to a plurality of values; and (ii) to determine if access to the data item is authorized or unauthorized based on whether or not the content-dependent name corresponds to at least one of said plurality of values, and (iii) based on whether or not it is determined that access to the data item is authorized or unauthorized, to allow the data item to be provided to or accessed by the second computer if it is not determined that access to the data item is unauthorized. 70. A computer-implemented method operable in a system which includes a network of computers, the system implemented at least in part by hardware including at least one processor, the method comprising the steps of: in response to a request at a first computer, from another computer, said request comprising at least a content-based identifier for a particular data item, the content-based identifier for the particular data item being based at least in part on a given function of at least some data which comprise the contents of the particular data item, wherein the given function comprises a message digest or a hash function, and wherein two identical data items will have the same content-based identifier: (A) hardware in combination with software, determining whether the content-based identifier for the particular data item corresponds to an entry in a database comprising a plurality of content-based identifiers; and (B) based at least in part on said determining in step (A), selectively permitting the particular data item to be accessed at or by one or more computers in the network of computers, said one or more computers being distinct from said first computer. 71. A computer-implemented method implemented at least in part by hardware comprising at least one processor and software, in combination with said hardware, the method comprising the steps: at a first location, by a first computer, (A) for a particular data item, said particular data item comprising a plurality of segments, for at least some of said plurality of segments, obtaining a corresponding content-dependent segment identifier from another computer at another location, each said corresponding content-dependent segment identifier being based, at least in part, on a given function of at least some of the data comprising the corresponding segment, wherein said given function for content-dependent segment identifier of at least one of the segments comprises at least a message digest function or hash function, and wherein two identical segments will have the same content-dependent segment identifier; and (B) hardware in combination with software, ascertaining whether or not at least some of said content-dependent segment identifiers have corresponding entries in a database comprising a plurality of content-dependent identifiers; and (C) based at least in part on said ascertaining in (B), selectively permitting access to the particular data item at one or more locations distinct from the first location, wherein, when the particular data item comprises a file or a portion of a file comprising an audio signal, the content-dependent segment identifier of at least one of the plurality of segments for particular data item is a function of at least some of the data comprising the audio signal; and wherein, when the particular data item comprises a file or a portion of a file comprising an video signal, the content-dependent segment identifier of at least one of the plurality of segments for particular data item is a function of at least some of the data comprising the video signal, and wherein said selectively permitting access to said particular data item in step (C) comprises one or more of: (a) selectively permitting copying of the data item to or from at least one of a plurality of computers; (b) selectively permitting providing of the data item to at least one of a plurality of computers; (c) selectively permitting reading of the data item; (d) selectively permitting copying of the data item; (e) selectively permitting distribution of the data item; (f) selectively permitting modification of the data item; (g) selectively permitting storage of the data item; (h) selectively permitting opening of the data item; (i) selectively permitting publishing of the data item; (j) selectively permitting writing the data item; (k) selectively permitting moving the data item; and (l) selectively permitting deleting the data item. 72. The method of claim 1 wherein step (c) comprises: determining whether or not access to the particular data item is authorized at or by one or more computers distinct from the first computer. 73. The method of claim 20 wherein the first location is the first computer. 74. The method of claim 20 wherein the second location is the second computer. 75. The method of claim 21 wherein the step (c) of determining takes place at said first location. 76. The method of claim 21 wherein the first location receives the content-dependent identifier from the requestor. 77. The system as in claim 67 wherein the at least one other computer is distinct from the first computer. 78. The system as in claim 68 wherein the identifier is received a the first location from the requestor. 79. The system of claim 68 wherein access to the particular data item comprises one or more of: (a) copying the data item to or from at least one of a plurality of computers; (b) providing the data item to at least one of a plurality of computers; (c) reading the data item; (d) copying the data item; (e) distributing the data item; (f) modifying the data item; (g) storing the data item; (h) opening the data item; (i) publishing the data item; (j) writing the data item; (k) moving the data item; and (l) deleting the data item. 80. The system of claim 69 wherein based on whether or not it is determined that access to the data item is authorized or unauthorized, the system allows the data item to be provided to the second computer from the first computer if it is not determined that access to the data item is unauthorized. 81. A device operable in a network of computers, the device comprising hardware including at least one processor and memory, to: (a) receive, at said device, from another device in the network, a content-based identifier for a particular sequence of bits, the content-based identifier being based at least in part on a function of at least some of the particular sequence of bits, wherein the function comprises a message digest function or a hash function, and wherein two identical sequences of bits will have the same content-based identifier; and to (b) compare the content-based identifier of the particular sequence of bits to a plurality of values; and to (c) selectively allow said particular sequence of bits to be provided to or accessed by other devices depending on whether or not said content-dependent identifier corresponds to one of the plurality of values. 82. The device of claim 81 wherein the particular sequence of bits represent data selected from the group comprising: a file, a portion of a file, a page in memory, a digital message, a portion of a digital message, a digital image, a portion of a digital image, a video signal, a portion of a video signal, an audio signal, a portion of an audio signal, a software product, and a portion of a software product. 83. The method of claim 1 wherein the content-based name for the particular data item comprises a request for the particular data item. 84. The method of claim 24 wherein the request regarding the particular data item is a request for the particular data item. 85. The system as in claim 69 wherein the request regarding the data item is a request for the data item. 86. A device operable in a network of computers, the device comprising hardware, including at least one processor and memory, to: (a) receive at said device, from another device in the network, a digital identifier for a particular sequence of bits, the digital identifier being based, at least in part, on a given function of at least some of the bits in the particular sequence of bits, wherein the given function comprises a message digest function or a hash function, and wherein two identical sequences of bits will have the same digital identifier; and (b) selectively allow the particular sequence of bits to be provided to or accessed by other devices in the system, based at least in part on whether or not the digital identifier for the particular sequence of bits corresponds to a value in a plurality of values, each of the plurality of values being based, at least in part, on the given function of at least some of the bits in a corresponding sequence of bits. 87. A device as in claim 86 wherein the device is a computer.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (137)
Gardner Alan S. (Potomac MD) McElrath Rodney D. (Fairfax VA) Harvey Stephen L. (Port Haywood VA), Apparatus and method for data storage and retrieval using bandwidth allocation.
Cuenod Jean-Christophe E. (Mountain View CA) Sichel Peter A. (Westford MA), Computer peripheral device network with peripheral address resetting capabilities.
Burnett Colin J. (Sydney AUX) Haas Garry L. (San Jose CA), Computer program product for object specification, generation, and management in a distributed database.
Rivest Ronald L. (Belmont MA), Data center for remote postage meter recharging system having physically secure encrypting apparatus and employing encry.
Farber David A. ; Lachman Ronald D., Data processing system using substantially unique identifiers to identify data items, whereby identical data items hav.
Blickenstaff Ronald L. (Boulder CO) Brant Catherine I. (Boulder CO) Dodd Paul D. (Niwot CO) Kirchner Anton H. (Boulder CO) Montez Jennifer K. (Thornton CO) Trede Brian E. (Boulder CO) Winter Richard , Data storage management for network interconnected processors.
Gruner Ronald H. (Cary NC) Clancy Gerald F. (Saratoga CA) Mundie Craig J. (Cary NC) Schleimer Stephen I. (Chapel Hill NC) Wallach Steven J. (Saratoga CA) Bratt Richard G. (Wayland MA) Gavrin Edward S, Digital data processing system having a uniquely organized memory system using object-based addressing and in which oper.
Fitzgerald Albion J. (Ridgewood NJ) Fitzgerald Joseph J. (New Paltz NY), Distributed computer network including hierarchical resource information structure and related method of distributing re.
Belsan Jay S. (Nederland CO) Laughlin Jeffrey S. (Nederland CO) Pedersen Mogens H. (Longmont CO) Raicer Robert J. (Niwot CO) Rudeseal George A. (Boulder CO) Schafer Charles P. (Louisville CO) Steele , File server having snapshot application data groups.
Gudmundson Norman K. ; MacInnis Bo Yu, Hierarchical encapsulation of instantiated objects in a multimedia authoring system including internet accessible objec.
Dixon Jerry D. (Boca Raton FL) Marazas Gerald A. (Boca Raton FL) Merckel Gerald U. (Delray Beach FL), I/O Storage controller cache system with prefetch determined by requested record\s position within data block.
Colwell Robert P. (Guilford CT) O\Donnell John (Guilford CT) Papworth David B. (Guilford CT) Rodman Paul K. (Madison CT), Instruction storage and cache miss recovery in a high speed multiprocessing parallel processing apparatus.
Colwell Robert P. (Guilford CT) O\Donnell John (Guilford CT) Papworth David B. (Guilford CT) Rodman Paul K. (Madison CT), Instruction storage method with a compressed format using a mask word.
Gopal Gita (Wayne NJ) Wuu Sze-Ying (Branchburg NJ), Linking system and method for accessing directory information about an object in one context when information in another.
Talbott Marvin T. (Plano TX) Burks Henry L. (Dallas TX) Shaw Richard W. (Plano TX) Amundsen Michael (Dallas TX) Hutchison Katherine K. (Dallas TX) Strasburg Donald D. (Plano TX), Method and apparatus for aiding system design.
Benhase Michael T. (Tucson AZ) Duke Alan H. (Tucson AZ), Method and apparatus for converting addresses of a backing store having addressable data storage devices for accessing a.
Churm Brian R. (Wheaton IL) Diesel Michael E. (Newark IL), Method and apparatus for data hashing using selection from a table of random numbers in combination with folding and bit.
Cahill Thomas (Newton NJ) Levine Glenn (Ossining NY) Goldfisher Saul (Brooklyn NY) Wilson Philip (Brooklyn NY), Method and apparatus for distributing files on a file storage device.
Ross Cliff D. (Pleasant Grove UT) Taylor Neil W. (Springville UT) Kingdon Kevin W. (Orem UT) Davis Howard R. (Salem UT) Major Drew (Orem UT), Method and apparatus for electronic licensing.
Hamilton Graham (Palo Alto CA) Kessler Peter B. (Palo Alto CA), Method and apparatus for generating and using short operation identifiers in object oriented systems.
Tirfing Soren J. (Palo Alto CA) Gramlich Wayne C. (Sunnyvale CA), Method and apparatus for searching database component files to retrieve information from modified files.
Cichelli Richard J. (Allentown PA) Thompson Michael Q. (Bethlehem PA) Cheswick William R. (New Hope PA), Method and apparatus for testing membership in a set through hash coding with allowable errors.
Gramlich Wayne C. (Sunnyvale CA) Tirfing Soren J. (Palo Alto CA), Method and apparatus for the naming of database component files to avoid duplication of files.
Garay Juan Alberto ; Gennaro Rosario ; Jutla Charanjit Singh ; Rabin Tal D., Method and apparatus for the secure distributed storage and retrieval of information.
Velissaropoulos T. Dora (Toronto CAX) Shum Peter K. (Richmond Hill CAX), Method and means for encoding storing and retrieving hierarchical data processing information for a computer system.
Cohn Oded (Haifa AZ ILX) Micka William F. (Tucson AZ) Nagin Kenneth M. (Tucson AZ) Novick Yoram (Haifa ILX) Winokur Alexander (Haifa ILX), Method and system for time zero backup session security.
Leighton Frank T. (15 Charlesden Pk. Newtonville MA 02160) Micali Silvio (459 Chestnut Hill Ave. Brookline MA 02146), Method for authenticating objects identified by images or other identifying information.
Alferness Merwin H. (New Brighton MN) Criswell Peter Bradley (Bethel MN) Johnson David Randal (Oakdale MN) McBreen James R. (Shoreview MN), Method for generating an internet protocol suite checksum in a single macro instruction.
Nuttall David J. H. (20634 NE. 181 Pl. Woodinville WA 98072) Brehm Bertram G. (25119 NE. 18 St. Redmond WA 98053), Method for modeling a physical system of elements using a relational database.
Brown Paul J. (Poughkeepsie NY) Fredericks ; Sr. Kenneth J. (Poughkeepsie NY) Hefferon Eugene P. (Poughkeepsie NY) Moffitt Gerald T. (San Jose CA) Meritt Allan S. (Poughkeepsie NY), Method for requesting identification of a neighbor node in a data processing I/O system.
Perelson Alan S. (820 Los Arboles La. Santa Fe NM 87501) Forrest Stephanie (440 Amherst NE Albuquerque NM 87106) Allen Lawrence C. (56 Tecolote Rd. Tijeras NM 87059), Method of detecting changes to a collection of digital signals.
Hale, John C.; Manes, Gavin W., Method to inhibit the identification and retrieval of proprietary media via automated search engines utilized in association with computer compatible communications network.
Nemes Richard M. (Brooklyn NY), Methods and apparatus for information storage and retrieval utilizing a method of hashing and different collision avoida.
Hunter John C. (Phoenix AZ) Wertz John A. (Phoenix AZ), Multi-node cluster computer system incorporating an external coherency unit at each node to insure integrity of informat.
Summer ; Jr. Charles F. (Orlando FL) Pettus Robert O. (Lexington SC) Bonnell Ronald D. (Lexington SC) Huhns Michael N. (Irmo SC) Stephens Larry M. (Columbia SC), Multiple-microcomputer processing.
Neches Philip M. (Pasadena CA) Hartke David H. (Los Angeles CA) Stockton Richard C. (Northridge CA) Watson Martin C. (Northridge CA) Cronshaw David (Torrance CA) Shemer Jack E. (Los Angeles CA), Multiprocessor intercommunication system and method.
Emry ; Jr. Carl A. (Round Rock TX) Neuman Grover H. (Austin TX) Mersiovsky Lynda K. (Austin TX) Pfeuffer Margaret S. (Raleigh NC), Page indexing system for accessing sequentially stored data representing a multi-page document.
Eisenberg Neal R. (San Jose CA) Huddleston Robert L. (Sunnyvale CA) Karasiuk Gary R. (Keswick CA CAX) Lehner Mary C. (San Jose CA) Tribolet Charles S. (Morgan Hill CA), Resolution of relationship source and target in a versioned database management system.
Tamura Toshiyuki (Itami JPX) Fujita Masaki (Itami JPX) Komori Shinji (Itami JPX) Sato Hisakazu (Itami JPX) Takata Hidehiro (Itami JPX), Retrieving data using hash memory address generated by reversing /xor bits of selected bit strings of an input packet id.
Blechschmidt James L. (Tempe AZ) Johnson Robert D. (Mesa AZ) Powell Robert F. (Mesa AZ), Shim and computerized chart for simultaneously adjusting camber and toe-in.
Barnes Cherie C. (Barton NY) Bennett Robert B. (Endwell NY) Szczygielski Thomas J. (Endicott NY), Space management system for data files having shared access.
Clark Carl E. (Poughkeepsie NY) Frey Jeffrey A. (Fishkill NY) Plambeck Kenneth E. (Poughkeepsie NY) Scalzi Casper A. (Poughkeepsie NY) Sinha Bhaskar (Wappingers Falls NY), Storage isolation with subspace-group facility.
Dockter Michael J. (Hollister CA) Farber Joel F. (San Jose CA) Seppi Kevin D. (Austin TX), Storing and retrieving heterogeneous classification systems utilizing globally unique identifiers.
Holloway John T. (Belmont MA) Moon David A. (Cambridge MA) Cannon Howard I. (Lexington MA) Knight Thomas F. (Belmont MA) Edwards Bruce E. (Belmont MA) Weinreb Daniel L. (Somerville MA), Symbolic language data processing system.
Holloway John T. (Belmont MA) Moon David A. (Cambridge MA) Cannon Howard I. (Sudbury MA) Knight Thomas F. (Belmont MA) Edwards Bruce E. (Belmont MA) Weinreb Daniel L. (Arlington MA), Symbolic language data processing system.
Bannon Thomas J. (Dallas TX) Ford Stephen J. (Plano TX) Joseph Vappala J. (Plano TX) Perez Edward R. (Dallas TX) Peterson Robert W. (Plano TX) Sparacin Diana M. (Plano TX) Thatte Satish M. (Richardso, System and method for database management supporting object-oriented programming.
Woodhill James R. (Houston TX) Woodhill Louis R. (Richmond TX) More ; Jr. William Russell (Houston TX) Berlin Jay Harris (Houston TX), System and method for distributed storage management on networked computer systems using binary object identifiers.
Cheng Edward C. (South San Francisco CA) Gawlick Dieter (Palo Alto CA) O\Neil Patrick E. (Lexington MA), System and method for efficiently indexing and storing a large database with high data insertion frequency.
Balick Maurice ; van Hoff Arthur A. ; McChesney Roderick J., System and method to control and administer distributed object servers using first class distributed objects.
Wittenberg David K. (Hudson MA) Leichter Jerrold S. (Stamford CT), System for controlling access to a secure system by verifying acceptability of proposed password by using hashing and gr.
Howell William E. (North Richland Hills TX) Reddy Hari N. (Grapevine TX) Wang Diana S. (Trophy Club TX), System for controlling group access to objects using group access control folder and group identification as individual.
Stefik Mark J. (Woodside CA) Bobrow Daniel G. (Palo Alto CA) Pirolli Peter L. T. (El Cerrito CA), System for controlling the distribution and use of composite digital works.
Hamilton Graham (Palo Alto CA) Powell Michael L. (Palo Alto CA) Chapin John (East Palo Alto CA), System for determination of the equivalence of two objects without compromising then done by a third object nominated by.
Burke Thomas J. (Chagrin Falls OH), System for generating unsolicited messages on high-tier communication link in response to changed states at station-leve.
Herz Frederick S. M. ; Eisner Jason M. ; Ungar Lyle H., System for generation of object profiles for a system for customized electronic identification of desirable objects.
Mansfield Bruce M. (Kent WA) Kolnick Frank C. (Willowdale CAX) Kun Andrew I. (Willowdale CAX), System for locating a file in a logical ring by sequentially forwarding access request with file system name and file na.
Boebert William E. ; Rogers Clyde O. ; Andreas Glenn ; Hammond Scott W. ; Gooderum Mark P., System for providing secure internetwork by connecting type enforcing secure computers to external network for limiting.
Flynn Rex A. (Belmont MA) Anick Peter G. (Marlboro MA), System for reconstructing prior versions of indexes using records indicating changes between successive versions of the.
Forrest Bradley A. (Rochester MN) Hager Dean J. (Rochester MN) Rose Curtis G. (Rochester MN), System for selecting document recipients as determined by technical content of document and for electronically corrobora.
Kindell Craig N. (Delray Beach FL) Milsted Kenneth L. (Boca Raton FL) Vogt Michael P. (Boca Raton FL) Waefler Susan E. (Delray Beach FL) Yoder Brian E. (Boca Raton FL), System for the management of multiple time-critical data streams.
Clancy Gerald F. (Saratoga CA) Mundie Craig J. (Cary NC) Schleimer Stephen I. (Chapel Hill NC) Wallach Steven J. (Saratoga CA) Bratt Richard G. (Wayland MA), Universal addressing system for a digital data processing system.
Farber, David A.; Greer, Richard E.; Swart, Andrew D.; Balter, James A., Delivering resources to clients in a distributed computing environment with rendezvous based on load balancing and network conditions.
Baker, Don; Carpentier, Paul R. M.; Klager, Andrew; Pierce, Aaron; Ring, Jonathan; Turpin, Russell; Yoakley, David, Erasure coding and replication in storage clusters.
Baker, Don; Carpentier, Paul R. M.; Klager, Andrew; Pierce, Aaron; Ring, Jonathan; Turpin, Russell; Yoakley, David, Erasure coding and replication in storage clusters.
Baker, Don; Carpentier, Paul R. M.; Klager, Andrew; Pierce, Aaron; Ring, Jonathan; Turpin, Russell; Yoakley, David, Erasure coding and replication in storage clusters.
Arai, Hitoshi; Kanie, Homare; Saika, Nobuyuki, Local file server transferring file to remote file server via communication network and storage system comprising those file servers.
Farber, David A.; Greer, Richard E.; Swart, Andrew D.; Balter, James A., Shared content delivery infrastructure with rendezvous based on load balancing and network conditions.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.