2008 IEEE 24th International Conference on Data Engineering 2008
DOI: 10.1109/icde.2008.4497535
|View full text |Cite
|
Sign up to set email alerts
|

Filtered Indices and Their Use in Flexible Schema Scenarios

Abstract: Efficient and convenient handling of heterogeneous data is a current challenge for data management systems. In this paper, we discuss several common relational approaches to represent heterogeneity and argue for a design based on a single wide-table, referred to as a flexible schema. For this scenario, we focus on partial indexation and its support for efficient data storage and processing.Filtered indices provide partial indexation functionality in the Microsoft SQL Server product. We describe here the implem… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
13
0

Year Published

2008
2008
2009
2009

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(13 citation statements)
references
References 10 publications
0
13
0
Order By: Relevance
“…1). The columns that do not pertain to the content type of a particular row are equal to null and the whole table remains sparse ( [3,17]). …”
Section: Flexible Schema Designmentioning
confidence: 99%
See 4 more Smart Citations
“…1). The columns that do not pertain to the content type of a particular row are equal to null and the whole table remains sparse ( [3,17]). …”
Section: Flexible Schema Designmentioning
confidence: 99%
“…The classic relational approaches of a property bag or ISA relation decomposition fail to handle heterogeneous collections efficiently ( [3,17]). For example, storing arbitrary objects in relational databases usually results in complex multi-table schemas and requires relevant translation instructions in object-relational mappers.…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations