2001 search results - page 116 / 401 » Indexing in a Hypertext Database |
SIGMOD
2006
ACM
14 years 9 months ago
2006
ACM
ct In some applications, data capture dominates query processing. For example, monitoring moving objects often requires more insertions and updates than queries. Data gathering usi...
ICDM
2009
IEEE
14 years 3 months ago
2009
IEEE
Since clustering is unsupervised and highly explorative, clustering validation (i.e. assessing the quality of clustering solutions) has been an important and long standing researc...
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
This paper presents Dynamic IPL B+ -tree (d-IPL in short) as a B+ -tree index variant for flash-based storage systems. The d-IPL B+ -tree adopts a dynamic In-Page Logging (IPL) s...
SAC
2005
ACM
14 years 2 months ago
2005
ACM
We present a novel indexing schema that provides efficient nearest-neighbor queries in multimedia databases consisting of objects described by multiple feature vectors. The beneï¬...
CIKM
2004
Springer
14 years 2 months ago
2004
Springer
An important class of queries is the LIKE predicate in SQL. In the absence of an index, LIKE queries are subject to performance degradation. The notion of indexing on substrings (...