scispace - formally typeset
Search or ask a question
Topic

Data element

About: Data element is a research topic. Over the lifetime, 4731 publications have been published within this topic receiving 85274 citations. The topic is also known as: unit of data.


Papers
More filters
Patent
20 Feb 2012
TL;DR: In this paper, the authors present a request identification and parsing process to locate object metadata and to handle the request in accordance therewith, where different types of metadata exist for a particular object, where metadata in a configuration file is overridden by metadata in response header or request string, with metadata in the request string taking precedence.
Abstract: To serve content through a content delivery network (CDN), the CDN must have some information about the identity, characteristics and state of its target objects. Such additional information is provided in the form of object metadata, which according to the invention can be located in the request string itself, in the response headers from the origin server, in a metadata configuration file distributed to CDN servers, or in a per-customer metadata configuration file. CDN content servers execute a request identification and parsing process to locate object metadata and to handle the request in accordance therewith. Where different types of metadata exist for a particular object, metadata in a configuration file is overridden by metadata in a response header or request string, with metadata in the request string taking precedence.

504 citations

Book ChapterDOI
31 Aug 2004
TL;DR: This paper analyzes the data partitioning (bucketization) technique and algorithmically develops this technique to build privacy-preserving indices on sensitive attributes of a relational table and develops a novel algorithm for achieving the desired balance between privacy and utility of the index.
Abstract: Database outsourcing is an emerging data management paradigm which has the potential to transform the IT operations of corporations. In this paper we address privacy threats in database outsourcing scenarios where trust in the service provider is limited. Specifically, we analyze the data partitioning (bucketization) technique and algorithmically develop this technique to build privacy-preserving indices on sensitive attributes of a relational table. Such indices enable an untrusted server to evaluate obfuscated range queries with minimal information leakage. We analyze the worst-case scenario of inference attacks that can potentially lead to breach of privacy (e.g., estimating the value of a data element within a small error margin) and identify statistical measures of data privacy in the context of these attacks. We also investigate precise privacy guarantees of data partitioning which form the basic building blocks of our index. We then develop a model for the fundamental privacy-utility tradeoff and design a novel algorithm for achieving the desired balance between privacy and utility (accuracy of range query evaluation) of the index.

481 citations

Patent
31 Mar 2000
TL;DR: In this article, a system and method for providing users with granular control over arbitrary information that allows for selective, real-time information sharing in a communications network such as the Internet is provided.
Abstract: A system and method for providing users with granular control over arbitrary information that allows for selective, real-time information sharing in a communications network such as the Internet is provided. In a network including a plurality of network devices operated by a plurality of users, a real-time information exchange system for sharing user profile information between respective users includes a database management system connected to the network. The database management system, which may be distributed across the network, stores the user profile information for a plurality of registered users of the information exchange system. The user profile information includes a plurality of data elements, each data element having an associated one of the plurality of registered users. Each data element has an associated group of users to whom access to the data element has been granted, and users not included in the associated group of users are denied access to the data element. Each registered user may selectively control the granting and denying of access to each of its associated data elements by other respective user, on an element-by-element, and user-by-user basis. Further, each registered user may dynamically create its own data fields.

460 citations

Patent
09 Feb 2000
TL;DR: In this paper, a data processing system having an efficient logging mechanism which stores log records for repairing a file system when its consistency is lost, is described, where the collected data is temporarily stored in a log buffer, and finally saved into a log volume by a log writing unit.
Abstract: A data processing system having an efficient logging mechanism which stores log records for repairing a file system when its consistency is lost. When there is a transaction attempting to update metadata stored in metadata volumes, a metadata loading unit reads the requested metadata objects out of the volumes and loads them to a metadata cache. At that time, a metadata manager updates its internal database to record from which metadata volume each metadata object has been fetched. Each time the transaction updates a metadata object in the cache, a log collection unit collects a copy of the updated metadata object, together with a volume ID which indicates its home metadata volume. The collected data is temporarily stored in a log buffer, and finally saved into a log volume by a log writing unit.

452 citations

Book ChapterDOI
01 Jan 1994
TL;DR: For the list object, introduced in Chapter 5, it was shown that each data element contains at most one predecessor element and one successor element, so for any given data element or node in the list structure, the authors can talk in terms of a next element and a previous element.
Abstract: For the list object, introduced in Chapter 5, it was shown that each data element contains at most one predecessor element and one successor element. Therefore, for any given data element or node in the list structure, we can talk in terms of a next element and a previous element.

381 citations


Network Information
Related Topics (5)
Information system
107.5K papers, 1.8M citations
79% related
Web service
57.6K papers, 989K citations
76% related
Web page
50.3K papers, 975.1K citations
73% related
Software
130.5K papers, 2M citations
72% related
The Internet
213.2K papers, 3.8M citations
72% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202320
202263
202142
202068
201990
201889