3311 search results - page 273 / 663 » Modeling Relational Data by the Adjacency Model |
129
Voted
BTW
2009
Springer
15 years 8 months ago
2009
Springer
: Simplifying data programming is a core mission of data management research. The issue at stake is to help engineers build efficient and robust data-centric applications. The fron...
122
click to vote
KDD
2006
ACM
16 years 5 months ago
2006
ACM
Ontologies represent data relationships as hierarchies of possibly overlapping classes. Ontologies are closely related to clustering hierarchies, and in this article we explore th...
146
click to vote
BTW
1999
Springer
15 years 9 months ago
1999
Springer
Abstract: Spatial data mining algorithms heavily depend on the efficient processing of neighborhood relations since the neighbors of many objects have to be investigated in a singl...
127
click to vote
PAKDD
2005
ACM
15 years 10 months ago
2005
ACM
Abstract. The data stream model of computation is often used for analyzing huge volumes of continuously arriving data. In this paper, we present a novel algorithm called DUCstream ...
144
click to vote
DOLAP
2004
ACM
15 years 10 months ago
2004
ACM
Parallelism can be used for major performance improvement in large Data warehouses (DW) with performance and scalability challenges. A simple low-cost shared-nothing architecture ...