enter search term and/or author name
B-trees have been ubiquitous in database management systems for several decades, and they are used in other storage systems as well. Their basic structure and basic operations are well and widely understood including search, insertion, and...
Continuous online index tuning in moving object databases
Su Chen, Mario A. Nascimento, Beng Chin Ooi, Kian-Lee Tan
Article No.: 17
In a Moving Object Database (MOD), the dataset, for example, the location of objects and their distribution, and the workload change frequently. Traditional static indexes are not able to cope well with such changes, that is, their...
This article examines a new problem of k-anonymity with respect to a reference dataset in privacy-aware location data publishing: given a user dataset and a sensitive event dataset, we want to generalize the user dataset such that by...
Improving XML search by generating and utilizing informative result snippets
Ziyang Liu, Yu Huang, Yi Chen
Article No.: 19
Snippets are used by almost every text search engine to complement the ranking scheme in order to effectively handle user searches, which are inherently ambiguous and whose relevance semantics are difficult to assess. Despite the fact that XML is...
Efficient and accurate nearest neighbor and closest pair search in high-dimensional space
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
Article No.: 20
Nearest Neighbor (NN) search in high-dimensional space is an important problem in many applications. From the database perspective, a good solution needs to have two properties: (i) it can be easily incorporated in a relational database, and (ii)...
We investigate the question of whether a query Q can be answered using a set V of views. We first define the problem in information-theoretic terms: we say that V determines Q if V provides enough information to...
Towards a logical reconstruction of a theory for locally closed databases
Marc Denecker, Álvaro Cortés-Calabuig, Maurice Bruynooghes, Ofer Arieli
Article No.: 22
The Closed World Assumption (CWA) on databases expresses the assumption that an atom not in the database is false. This assumption is applicable only in cases where the database has complete knowledge about the domain of discourse. In this...