Name
Abstract | ||
|---|---|---|
Traditional indices in relational databases are designed for queries that are selective by value. However, queries can also retrieve records on their relational structure. In our research, we found that traditional indices are ineffective for structurally selective queries. To accelerate such queries, socalled u0027structural indicesu0027 have been applied in graph databases. These indices group together structurally similar nodes to obtain a compact representation of the graph structure. We studied how structural indices can be applied in relational databases and evaluated their performance. Guarded bisimulation groups together relational tuples with similar structure, which we use to obtain a guarded structural index. Our solution requires significantly less space than traditional indices. At the same time, it can offer several orders of magnitude faster query evaluation performance. |
Year | Venue | Field |
|---|---|---|
2016 | EDBT | Graph,Data mining,Graph database,Relational database,Computer science,Tuple,Relational structure,Search engine indexing,Theoretical computer science,Bisimulation |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
2 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Erik Agterdenbos | 1 | 0 | 0.34 |
| George H. L. Fletcher | 2 | 336 | 43.30 |
| Chee Yong Chan | 3 | 643 | 199.24 |
| Stijn Vansummeren | 4 | 667 | 45.68 |