Sciweavers

709 search results - page 73 / 142
» Efficient Evaluation of All-Nearest-Neighbor Queries
Sort
View
SIGMOD
2004
ACM
241views Database» more  SIGMOD 2004»
16 years 6 months ago
SINA: Scalable Incremental Processing of Continuous Queries in Spatio-temporal Databases
This paper introduces the Scalable INcremental hash-based Algorithm (SINA, for short); a new algorithm for evaluating a set of concurrent continuous spatio-temporal queries. SINA ...
Mohamed F. Mokbel, Xiaopeng Xiong, Walid G. Aref
EDBT
2008
ACM
124views Database» more  EDBT 2008»
16 years 6 months ago
Multi-dimensional search for personal information management systems
With the explosion in the amount of semi-structured data users access and store in personal information management systems, there is a need for complex search tools to retrieve of...
Amélie Marian, Christopher Peery, Thu D. Ng...
DOLAP
1999
ACM
15 years 10 months ago
Design and Selection of Materialized Views in a Data Warehousing Environment: A Case Study
In this paper, we describe the design of a data warehousing system for an engineering company ‘R’. This system aims to assist users in retrieving data for business analysis in...
Goretti K. Y. Chan, Qing Li, Ling Feng
256
Voted
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
16 years 7 months ago
A Lightweight Online Framework For Query Progress Indicators
Recently there has been increasing interest in the development of progress indicators for SQL queries. In this paper we present a lightweight online framework for this problem. Ou...
Chaitanya Mishra, Nick Koudas
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
16 years 7 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella