Sciweavers

4081 search results - page 78 / 817
» Metaprogramming for Relational Databases
Sort
View
VLDB
2000
ACM
114views Database» more  VLDB 2000»
15 years 8 months ago
The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation
We propose a novel index structure, A-tree (Approximation tree), for similarity search of high-dimensional data. The basic idea of the
Yasushi Sakurai, Masatoshi Yoshikawa, Shunsuke Uem...
DATESO
2009
121views Database» more  DATESO 2009»
15 years 2 months ago
Translation of Ontology Retrieval Problem into Relational Queries
Ontology as a knowledge base can provide different reasoning tasks, e.g. to check consistency of the ontology or to check whether a resource is instance of a concept or not. In thi...
Jaroslav Pokorný, Jana Pribolová, Pe...
CORR
2004
Springer
92views Education» more  CORR 2004»
15 years 4 months ago
Paraconsistent Intuitionistic Fuzzy Relational Data Model
Rajshekhar Sunderraman, Haibin Wang
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
16 years 5 months ago
Characteristic relational patterns
Research in relational data mining has two major directions: finding global models of a relational database and the discovery of local relational patterns within a database. While...
Arne Koopman, Arno Siebes
PODS
2009
ACM
113views Database» more  PODS 2009»
16 years 5 months ago
Relative information completeness
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
Wenfei Fan, Floris Geerts