Sciweavers

1611 search results - page 7 / 323
» Queries Independent of Updates
Sort
View
VLDB
2000
ACM
163views Database» more  VLDB 2000»
14 years 5 hour ago
Hierarchical Compact Cube for Range-Max Queries
A range-max query finds the maximum value over all selected cells of an on-line analytical processing (OLAP) data cube where the selection is specified by ranges of contiguous val...
Sin Yeung Lee, Tok Wang Ling, Hua-Gang Li
COOPIS
2004
IEEE
14 years 5 days ago
Security Management Through Overloading Views
The model of overloading views is a facility allowing the programmer to separate some kinds of crosscutting concerns that occur during design, implementation and maintenance of dat...
Radoslaw Adamus, Kazimierz Subieta
ISCI
2008
93views more  ISCI 2008»
13 years 8 months ago
Safety, domain independence and translation of complex value database queries
This paper considers the theory of database queries on the complex value data model with external functions. Motivated by concerns regarding query evaluation, we first identify re...
Hong-Cheu Liu, Jeffrey Xu Yu, Weifa Liang
ICDE
2007
IEEE
175views Database» more  ICDE 2007»
14 years 9 months ago
Dynamic Batch Nearest Neighbor Search in Video Retrieval
To retrieve similar database videos to a query clip, each video is typically represented by a sequence of highdimensional feature vectors. Given a query video containing m feature...
Jie Shao, Zi Huang, Heng Tao Shen, Xiaofang Zhou, ...
VLDB
2009
ACM
381views Database» more  VLDB 2009»
14 years 8 months ago
Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN
In this paper, we study the problem of continuous monitoring of reverse k nearest neighbor queries. Existing continuous reverse nearest neighbor monitoring techniques are sensitive...
Muhammad Aamir Cheema, Xuemin Lin, Ying Zhang, Wei...