Sciweavers

2635 search results - page 336 / 527
» Algorithms for the Database Layout Problem
Sort
View
ICDE
2005
IEEE
172views Database» more  ICDE 2005»
16 years 2 days ago
Monitoring K-Nearest Neighbor Queries Over Moving Objects
Many location-based applications require constant monitoring of k-nearest neighbor (k-NN) queries over moving objects within a geographic area. Existing approaches to this problem...
Xiaohui Yu, Ken Q. Pu, Nick Koudas
CIKM
2005
Springer
15 years 12 months ago
Selectivity-based partitioning: a divide-and-union paradigm for effective query optimization
Modern query optimizers select an efficient join ordering for a physical execution plan based essentially on the average join selectivity factors among the referenced tables. In ...
Neoklis Polyzotis
166
Voted
DNIS
2005
Springer
102views Database» more  DNIS 2005»
15 years 12 months ago
An Improved Approach to Extract Document Summaries Based on Popularity
With the rapid growth of the Internet, most of the textual data in the form of newspapers, magazines and journals tend to be available on-line. Summarizing these texts can aid the...
P. Arun Kumar, K. Praveen Kumar, T. Someswara Rao,...
SSD
2005
Springer
173views Database» more  SSD 2005»
15 years 12 months ago
On Discovering Moving Clusters in Spatio-temporal Data
A moving cluster is defined by a set of objects that move close to each other for a long time interval. Real-life examples are a group of migrating animals, a convoy of cars movin...
Panos Kalnis, Nikos Mamoulis, Spiridon Bakiras
DMKD
2004
ACM
136views Data Mining» more  DMKD 2004»
15 years 12 months ago
Mining association rules with non-uniform privacy concerns
Privacy concerns have become an important issue in data mining. A popular way to preserve privacy is to randomize the dataset to be mined in a systematic way and mine the randomiz...
Yi Xia, Yirong Yang, Yun Chi