enter search term and/or author name
Dynamic indexing for multidimensional non-ordered discrete data spaces using a data-partitioning approach
Gang Qian, Qiang Zhu, Qiang Xue, Sakti Pramanik
Similarity searches in multidimensional Non-ordered Discrete Data Spaces (NDDS) are becoming increasingly important for application areas such as bioinformatics, biometrics, data mining and E-commerce. Efficient similarity searches require robust...
Maintenance of K-nn and spatial join queries on continuously moving points
Glenn S. Iwerks, Hanan Samet, Kenneth P. Smith
Cars, aircraft, mobile cell phones, ships, tanks, and mobile robots all have the common property that they are moving objects. A kinematic representation can be used to describe the location of these objects as a function of time. For example, a...
Query optimization in distributed networks of autonomous database systems
Fragkiskos Pentaris, Yannis Ioannidis
Large-scale distributed environments, where each node is completely autonomous and offers services to its peers through external communication, pose significant challenges to query processing and optimization. Autonomy is the main source of the...
Summarizing level-two topological relations in large spatial datasets
Xuemin Lin, Qing Liu, Yidong Yuan, Xiaofang Zhou, Hongjun Lu
Summarizing topological relations is fundamental to many spatial applications including spatial query optimization. In this article, we present several novel techniques to effectively construct cell density based spatial histograms for range (window)...
Adaptive pull-based policies for wide area data delivery
Laura Bright, Avigdor Gal, Louiqa Raschid
Wide area data delivery requires timely propagation of up-to-date information to thousands of clients over a wide area network. Applications include web caching, RSS source monitoring, and email access via a mobile network. Data sources vary widely...
Rewriting queries with arbitrary aggregation functions using views
Sara Cohen, Werner Nutt, Yehoshua Sagiv
The problem of rewriting aggregate queries using views is studied for conjunctive queries with arbitrary aggregation functions and built-in predicates. Two types of queries over views are introduced for rewriting aggregate queries: pure...
Domain-independent data cleaning via analysis of entity-relationship graph
Dmitri V. Kalashnikov, Sharad Mehrotra
In this article, we address the problem of reference disambiguation. Specifically, we consider a situation where entities in the database are referred to using descriptions (e.g., a set of instantiated attributes). The objective of reference...