Sciweavers

2859 search results - page 136 / 572
» Querying Complex Structured Databases
Sort
View
ISM
2006
IEEE
207views Multimedia» more  ISM 2006»
13 years 8 months ago
Affinity Hybrid Tree: An Indexing Technique for Content-Based Image Retrieval in Multimedia Databases
A novel indexing and access method, called Affinity Hybrid Tree (AH-Tree), is proposed to organize large image data sets efficiently and to support popular image access mechanisms...
Kasturi Chatterjee, Shu-Ching Chen
PODS
2006
ACM
217views Database» more  PODS 2006»
14 years 8 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
EDBT
2006
ACM
150views Database» more  EDBT 2006»
14 years 8 months ago
Improving the Efficiency of XPath Execution on Relational Systems
: This work describes a method for processing XPath on a relational back-end that significantly limits the number of SQL joins required, takes advantage of the strengths of modern ...
Haris Georgiadis, Vasilis Vassalos
ICDE
2006
IEEE
128views Database» more  ICDE 2006»
14 years 2 months ago
Searching and Ranking Documents based on Semantic Relationships
Just as the link structure of the web is a critical component in today's web search, complex relationships (i.e., the different ways the dots are connected) will be an import...
Boanerges Aleman-Meza
PODS
2000
ACM
120views Database» more  PODS 2000»
13 years 11 months ago
Indexing the Edges - A Simple and Yet Efficient Approach to High-Dimensional Indexing
In this paper, we propose a new tunable index scheme, called iMinMax , that maps points in high dimensional spaces to single dimension values determined by their maximum or minimu...
Beng Chin Ooi, Kian-Lee Tan, Cui Yu, Stépha...