339 search results - page 26 / 68 » Improved Query Performance with Variant Indexes |
210
click to vote
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
125
click to vote
PVLDB
2011
14 years 3 months ago
2011
Adaptive indexing is characterized by the partial creation and refinement of the index as side effects of query execution. Dynamic or shifting workloads may benefit from prelimi...
VLDB
2000
ACM
15 years 4 months ago
2000
ACM
Primary B+ -tree, a variant of B+ -tree structure with row data in leaf blocks, is an ideal storage organization for queries involving exact match and/or range search on primary k...
191
click to vote
SIGMOD
2007
ACM
16 years 17 days ago
2007
ACM
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...
103
Voted
ISMIR
2003
Springer
15 years 5 months ago
2003
Springer
In this paper we examine the retrieval performance of adjacent and concurrent n-grams generated from polyphonic music data. We deploy a method to index polyphonic music using a wo...