VLDB
2002
ACM
13 years 11 months ago
2002
ACM
VLDB
2002
ACM
13 years 11 months ago
2002
ACM
Schema matching is the task of finding semantic correspondences between elements of two schemas. It is needed in many database applications, such as integration of web data source...
VLDB
2002
ACM
13 years 11 months ago
2002
ACM
The BANKS system enables keyword-based search on databases, together with data and schema browsing. BANKS enables users to extract information in a simple manner without any knowl...
VLDB
2002
ACM
13 years 11 months ago
2002
ACM
The Hippocratic Oath has guided the conduct of physicians for centuries. Inspired by its tenet of preserving privacy, we argue that future database systems must include responsibi...
VLDB
2002
ACM
13 years 11 months ago
2002
ACM
We enunciate the need for watermarking database relations to deter their piracy, identify the unique characteristics of relational data which pose new challenges for watermarking,...
VLDB
2002
ACM
14 years 11 months ago
2002
ACM
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
VLDB
2002
ACM
14 years 11 months ago
2002
ACM
Several organizations have developed very large market basket databases for the maintenance of customer transactions. New applications, e.g., Web recommendation systems, present th...
VLDB
2002
ACM
14 years 11 months ago
2002
ACM
Abstract This paper describes the overall design and architecture of the Timber XML database system currently being implemented at the University of Michigan. The system is based u...
116
click to vote
VLDB
2002
ACM
14 years 11 months ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
VLDB
2002
ACM
14 years 11 months ago
2002
ACM
Abstract. We propose an indexing technique for the fast retrieval of objects in 2D images based on similarity between their boundary shapes. Our technique is robust in the presence...