Sciweavers

2001 search results - page 95 / 401
» Indexing in a Hypertext Database
Sort
View
SIGMOD
2005
ACM
89views Database» more  SIGMOD 2005»
14 years 2 months ago
Stacked indexed views in microsoft SQL server
Appropriately selected materialized views (also called indexed views) can speed up query execution by orders of magnitude. Most database systems limit support for materialized vie...
David DeHaan, Per-Åke Larson, Jingren Zhou
CIVR
2003
Springer
269views Image Analysis» more  CIVR 2003»
14 years 2 months ago
HPAT Indexing for Fast Object/Scene Recognition Based on Local Appearance
Abstract. The paper describes a fast system for appearance based image recognition . It uses local invariant descriptors and efficient nearest neighbor search. First, local affine ...
Hao Shao, Tomás Svoboda, Tinne Tuytelaars, ...
CVPR
2007
IEEE
14 years 11 months ago
Efficient Indexing For Articulation Invariant Shape Matching And Retrieval
Most shape matching methods are either fast but too simplistic to give the desired performance or promising as far as performance is concerned but computationally demanding. In th...
Soma Biswas, Gaurav Aggarwal, Rama Chellappa
ICDE
2008
IEEE
147views Database» more  ICDE 2008»
14 years 10 months ago
Fast Indexes and Algorithms for Set Similarity Selection Queries
Data collections often have inconsistencies that arise due to a variety of reasons, and it is desirable to be able to identify and resolve them efficiently. Set similarity queries ...
Marios Hadjieleftheriou, Amit Chandel, Nick Koudas...
ICDE
2006
IEEE
147views Database» more  ICDE 2006»
14 years 10 months ago
VBI-Tree: A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes
Multi-dimensional data indexing has received much attention in a centralized database. However, not so much work has been done on this topic in the context of Peerto-Peer systems....
H. V. Jagadish, Beng Chin Ooi, Quang Hieu Vu, Rong...