Sciweavers

72 search results - page 11 / 15
» On the Selection of Optimal Index Configuration in OO Databa...
Sort
View
ICDE
2002
IEEE
102views Database» more  ICDE 2002»
14 years 8 months ago
Cost Models for Overlapping and Multi-Version B-Trees
Overlapping and multi-version techniques are two popular frameworks that transform an ephemeral index into a multiple logical-tree structure in order to support versioning databas...
Yufei Tao, Dimitris Papadias, Jun Zhang
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 10 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
EDBT
2008
ACM
156views Database» more  EDBT 2008»
14 years 7 months ago
Online recovery in cluster databases
Cluster based replication solutions are an attractive mechanism to provide both high-availability and scalability for the database backend within the multi-tier information system...
WeiBin Liang, Bettina Kemme
SIGMOD
2009
ACM
161views Database» more  SIGMOD 2009»
14 years 7 months ago
Automated SQL tuning through trial and (sometimes) error
SQL tuning--the attempt to improve a poorly-performing execution plan produced by the database query optimizer-is a critical aspect of database performance tuning. Ironically, as ...
Herodotos Herodotou, Shivnath Babu
CIKM
2009
Springer
14 years 2 months ago
Independent informative subgraph mining for graph information retrieval
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles