Sciweavers

4805 search results - page 26 / 961
» On the Analysis of Indexing Schemes
Sort
View
EDBT
2006
ACM
156views Database» more  EDBT 2006»
14 years 8 months ago
Indexing Incomplete Databases
Incomplete databases, that is, databases that are missing data, are present in many research domains. It is important to derive techniques to access these databases efficiently. We...
Guadalupe Canahuate, Michael Gibas, Hakan Ferhatos...
72
Voted
ICDE
2000
IEEE
158views Database» more  ICDE 2000»
14 years 9 months ago
Analyzing Range Queries on Spatial Data
Analysis of range queries on spatial (multidimensional) data is both important and challenging. Most previous analysis attempts have made certain simplifying assumptions about the...
Ji Jin, Ning An, Anand Sivasubramaniam
SIGMOD
2002
ACM
169views Database» more  SIGMOD 2002»
14 years 8 months ago
Covering indexes for branching path queries
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...
IJCNN
2000
IEEE
14 years 9 days ago
Regression Analysis for Rival Penalized Competitive Learning Binary Tree
The main aim of this paper is to develop a suitable regression analysis model for describing the relationship between the index efficiency and the parameters of the Rival Penaliz...
Xuequn Li, Irwin King
MLDM
1999
Springer
14 years 5 days ago
Non-hierarchical Clustering with Rival Penalized Competitive Learning for Information Retrieval
In large content-based image database applications, e cient information retrieval depends heavily on good indexing structures of the extracted features. While indexing techniques f...
Irwin King, Tak-Kan Lau