• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 3,958
Next 10 →

Adding structure to unstructured data

by Peter Buneman, Susan Davidson, Mary Fernandez, Dan Suciu - In 6th Int. Conf. on Database Theory (ICDT ’97),LNCS 1186, 336–350 , 1997
"... We develop a new schema for unstructured data. Traditional schemas resemble the type systems of programming languages. For unstructured data, however, the underlying type may be much less constrained and hence an alternative way of expressing constraints on the data is needed. Here, we propose that ..."
Abstract - Cited by 218 (22 self) - Add to MetaCart
We develop a new schema for unstructured data. Traditional schemas resemble the type systems of programming languages. For unstructured data, however, the underlying type may be much less constrained and hence an alternative way of expressing constraints on the data is needed. Here, we propose

A Query Language and Optimization Techniques for Unstructured Data

by Peter Buneman, Susan Davidson, Gerd Hillebrand, Dan Suciu , 1996
"... A new kind of data model has recently emerged in which the database is not constrained by a conventional schema. Systems like ACeDB, which has become very popular with biologists, and the recent Tsimmis proposal for data integration organize data in tree-like structures whose components can be used ..."
Abstract - Cited by 407 (35 self) - Add to MetaCart
A new kind of data model has recently emerged in which the database is not constrained by a conventional schema. Systems like ACeDB, which has become very popular with biologists, and the recent Tsimmis proposal for data integration organize data in tree-like structures whose components can be used

Programming constructs for unstructured data

by Peter Buneman, Susan Davidson, Dan Suciu , 1995
"... ..."
Abstract - Cited by 75 (8 self) - Add to MetaCart
Abstract not found

Breaking Abstractions and Unstructuring Data Structures

by Christian Collberg, Clark Thomborson, Douglas Low - In International Conference on Computer Languages , 1998
"... ions and Unstructuring Data Structures Christian Collberg Clark Thomborson Douglas Low Department of Computer Science, The University of Auckland, Private Bag 92019, Auckland, New Zealand. fcollberg,cthombor,dlow001g@cs.auckland.ac.nz Abstract To ensure platform independence, mobile programs are ..."
Abstract - Cited by 93 (8 self) - Add to MetaCart
ions and Unstructuring Data Structures Christian Collberg Clark Thomborson Douglas Low Department of Computer Science, The University of Auckland, Private Bag 92019, Auckland, New Zealand. fcollberg,cthombor,dlow001g@cs.auckland.ac.nz Abstract To ensure platform independence, mobile programs

Anonymity in Unstructured Data

by Manolis Terrovitis, Nikos Mamoulis, Panos Kalnis
"... In this paper we study the problem of protecting privacy in the publication of set-valued data. Con-sider a collection of transactional data that contains detailed information about items bought together by individuals. Even after removing all personal characteristics of the buyer, which can serve a ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
In this paper we study the problem of protecting privacy in the publication of set-valued data. Con-sider a collection of transactional data that contains detailed information about items bought together by individuals. Even after removing all personal characteristics of the buyer, which can serve

Anonymizing Unstructured Data

by Rajeev Motwani, Shubha U. Nabar , 2008
"... In this paper we consider the problem of anonymizing datasets in which each individual is associated with a set of items that constitute private information about the individual. Illustrative datasets include market-basket datasets and search engine query logs. We formalize the notion of k-anonymity ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
-anonymity for set-valued data as a variant of the k-anonymity model for traditional relational datasets. We define an optimization problem that arises from this definition of anonymity and provide O(k log k) and O(1)-approximation algorithms for the same. We demonstrate applicability of our algorithms

Approaches for Managing and Analyzing Unstructured Data

by N. Veeranjaneyulu, M. Nirupama Bhat, A. Raghunath
"... Abstract — Large volumes of data that will be stored and accessed in future is unstructured. The unstructured data is generated in a very fast pace and uses large storage areas. This increases the storage budget. Extracting value from this unstructured data which balances the budget is the most chal ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract — Large volumes of data that will be stored and accessed in future is unstructured. The unstructured data is generated in a very fast pace and uses large storage areas. This increases the storage budget. Extracting value from this unstructured data which balances the budget is the most

Answering structured queries on unstructured data

by Jing Liu - In WebDB , 2006
"... There is growing number of applications that require access to both structured and unstructured data. Such collections of data have been referred to as dataspaces, and Dataspace Support Platforms (DSSPs) were proposed to offer several services over dataspaces, including search and query, source disc ..."
Abstract - Cited by 18 (0 self) - Add to MetaCart
There is growing number of applications that require access to both structured and unstructured data. Such collections of data have been referred to as dataspaces, and Dataspace Support Platforms (DSSPs) were proposed to offer several services over dataspaces, including search and query, source

Lightweight Database Wrapper for Unstructured Data

by Tulay Muezzinoglu, Antonio Badia
"... We propose an approach to interpreting a structured query language over unstructured data. We define partial records on heterogeneous relations as a means to bridge the gap between structured and unstructured data, as well as an algebra that merges relational operations with Information Extraction o ..."
Abstract - Add to MetaCart
We propose an approach to interpreting a structured query language over unstructured data. We define partial records on heterogeneous relations as a means to bridge the gap between structured and unstructured data, as well as an algebra that merges relational operations with Information Extraction

Browsing Mixed Structured And Unstructured Data

by Robert M. Losee - INFORMATION PROCESSING AND MANAGEMENT , 2006
"... Both structured and unstructured data, as well as structured data representing several different types of tuples, may be integrated into a single list for browsing or retrieval. Data may be arranged in the Gray code order of the features and metadata, producing optimal ordering for browsing. We p ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
Both structured and unstructured data, as well as structured data representing several different types of tuples, may be integrated into a single list for browsing or retrieval. Data may be arranged in the Gray code order of the features and metadata, producing optimal ordering for browsing. We
Next 10 →
Results 1 - 10 of 3,958
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University