Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

DeepDyve requires Javascript to function. Please enable Javascript on your browser to continue.

The VLDB Journal Volume 20 Issue 1

Subject Areas: Hardware and Architecture;
Publisher: Springer-Verlag - Springer Journals
ISSN: 1066-8888
SJR: 91

LitStream

Journal Article

Providing built-in keyword search capabilities in RDBMS

Li, Guoliang; Feng, Jianhua; Zhou, Xiaofang; Wang, Jianyong

2011 The VLDB Journal

doi:10.1007/s00778-010-0188-4

A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs transformed from relational data. These methods, however, are rather expensive as the minimum Steiner tree problem is known to be NP-hard. Further, these methods are...
LitStream

Journal Article

Speed up kernel discriminant analysis

Cai, Deng; He, Xiaofei; Han, Jiawei

2011 The VLDB Journal

doi:10.1007/s00778-010-0189-3

Linear discriminant analysis (LDA) has been a popular method for dimensionality reduction, which preserves class separability. The projection vectors are commonly obtained by maximizing the between-class covariance and simultaneously minimizing the within-class covariance. LDA can be performed...
LitStream

Journal Article

Scalable keyword search on large data streams

Qin, Lu; Yu, Jeffrey; Chang, Lijun

2011 The VLDB Journal

doi:10.1007/s00778-010-0190-x

It is widely recognized that the integration of information retrieval ( IR ) and database ( DB ) techniques provides users with a broad range of high quality services. Along this direction, IR -styled m -keyword query processing over a relational database in an rdbms framework has been well...
LitStream

Journal Article

SABRE: a Sensitive Attribute Bucketization and REdistribution framework for t -closeness

Cao, Jianneng; Karras, Panagiotis; Kalnis, Panos; Tan, Kian-Lee

2011 The VLDB Journal

doi:10.1007/s00778-010-0191-9

Today, the publication of microdata poses a privacy threat: anonymous personal records can be re-identified using third data sources. Past research has tried to develop a concept of privacy guarantee that an anonymized data set should satisfy before publication, culminating in the notion of t...
LitStream

Journal Article

Local and global recoding methods for anonymizing set-valued data

Terrovitis, Manolis; Mamoulis, Nikos; Kalnis, Panos

2011 The VLDB Journal

doi:10.1007/s00778-010-0192-8

In this paper, we study the problem of protecting privacy in the publication of set-valued data. Consider a collection of supermarket transactions that contains detailed information about items bought together by individuals. Even after removing all personal characteristics of the buyer, which...
LitStream

Journal Article

Probabilistic inverse ranking queries in uncertain databases

Lian, Xiang; Chen, Lei

2011 The VLDB Journal

doi:10.1007/s00778-010-0195-5

Query processing in the uncertain database has become increasingly important due to the wide existence of uncertain data in many real applications. Different from handling precise data, the uncertain query processing needs to consider the data uncertainty and answer queries with confidence...
LitStream

Journal Article

Ranking queries on uncertain data

Hua, Ming; Pei, Jian; Lin, Xuemin

2011 The VLDB Journal

doi:10.1007/s00778-010-0196-4

Uncertain data is inherent in a few important applications. It is far from trivial to extend ranking queries (also known as top- k queries), a popular type of queries on certain data, to uncertain data. In this paper, we cast ranking queries on uncertain data using three parameters: rank...

results per page

Prev
1
Next