TL;DR: This work describes schemes that enable a user to access k replicated copies of a database and privately retrieve information stored in the database, so that each individual server gets no information on the identity of the item retrieved by the user.
Abstract: Publicly accessible databases are an indispensable resource for retrieving up-to-date information. But they also pose a significant risk to the privacy of the user, since a curious database operator can follow the user's queries and infer what the user is after. Indeed, in cases where the users' intentions are to be kept secret, users are often cautious about accessing the database. It can be shown that when accessing a single database, to completely guarantee the privacy of the user, the whole database should be down-loaded; namely n bits should be communicated (where n is the number of bits in the database).In this work, we investigate whether by replicating the database, more efficient solutions to the private retrieval problem can be obtained. We describe schemes that enable a user to access k replicated copies of a database (k≥2) and privately retrieve information stored in the database. This means that each individual server (holding a replicated copy of the database) gets no information on the identity of the item retrieved by the user. Our schemes use the replication to gain substantial saving. In particular, we present a two-server scheme with communication complexity O(n1/3).
TL;DR: This comprehensive reference contains 1,300 illustrated entries, organized alphabetically, providing easy access to important concepts relevant information on all aspects of very large databases, data management, and database systems, including areas of current interest and research results of historical significance.
Abstract: Data have become a highly valued asset for governments, industries and individuals, and the management of these data collections remains a critical technical challenge.. The challenges of managing terabytes and exabytes of data and expanding data management to include other data modalities while maintaining the fundamental tenets of database management (data independence, data integrity, data consistency, etc) are important issues for any organization today. Published as five volumes with over 4000 pages, the Encyclopedia of Database Systems provides easy access to important concepts relevant information on all aspects of very large databases, data management, and database systems, including areas of current interest and research results of historical significance.. This comprehensive reference contains 1,300 illustrated entries, organized alphabetically. Each entry presents basic terminology, concepts, methods and algorithms, key results to date, references to the literature, and cross-references to other entries. Topics for the Encyclopedia including areas of current interest as well as research results of historical significance were selected by a distinguished international advisory board and written by world class experts in the field. Encyclopedia of Database Systems is designed to meet the needs of researchers, professors, graduate and undergraduate students in computer science and engineering. Industry professionals such as database specialists and software developers will also benefit from this reference work.
TL;DR: With this book, standards are defined for object management systems and this will be the foundational book for object-oriented database product.
Abstract: This book is the first of its kind and is produced as a result of the efforts by a consortium of database companies called the Object Database Management Group (ODMG). With this book, standards are defined for object management systems and this will be the foundational book for object-oriented database product.
TL;DR: In this article, a "return on investment" digital database usage metering, billing, and security system includes a hardware device which is plugged into a computer system bus (or into a serial or other functionally adequate connector) and a software program resident in the hardware device.
Abstract: A "return on investment" digital database usage metering, billing, and security system includes a hardware device which is plugged into a computer system bus (or into a serial or other functionally adequate connector) and a software program system resident in the hardware device. One or more databases are encrypted and stored on a non-volatile mass storage device (e.g., an optical disk). A tamper-proof decrypting device and associated controller decrypts selected portions of the stored database and measures the quantity of information which is decrypted. This measured quantity information is communicated to a remote centralized billing facility and used to charge the user a fee based on database usage. A system may include a "self-destruct" feature which .disables system operation upon occurrence of a predetermined event unless the user implements an "antidote"--instructions for implementing the antidote being given to him by the database owner only if the user pays his bill. Absolute database security and billing based on database usage are thus provided in a system environment wherein all database access tasks are performed at the user's site. Moreover, a free market competitive environment is supported because literary property royalties can be calculated based on actual data use.
TL;DR: In this article, the authors propose a method to assign importance ranks to nodes in a linked database, such as any database of documents containing citations, the world wide web or any other hypermedia database.
Abstract: A method assigns importance ranks to nodes in a linked database, such as any database of documents containing citations, the world wide web or any other hypermedia database. The rank assigned to a document is calculated from the ranks of documents citing it. In addition, the rank of a document is calculated from a constant representing the probability that a browser through the database will randomly jump to the document. The method is particularly useful in enhancing the performance of search engine results for hypermedia databases, such as the world wide web, whose documents have a large variation in quality.