Sciweavers

496 search results - page 12 / 100
» Efficient Implementation of Semantic Relations in Lexical Da...
Sort
View
ICDE
2005
IEEE
98views Database» more  ICDE 2005»
14 years 1 months ago
An Implementation Scheme of Relational Tables
AbstractAbstractAbstract In this paper, an implementation scheme for relational tables is proposed. Our scheme employs extendible chunked arrays. We are proposing an implementation...
Masayuki Kuroda, Naoki Amma, K. M. Azharul Hasan, ...
KCAP
2003
ACM
14 years 29 days ago
Modularisation of domain ontologies implemented in description logics and related formalisms including OWL
Modularity is a key requirement for large ontologies in order to achieve re-use, maintainability, and evolution. Mechanisms for ‘normalisation’ to achieve analogous aims are s...
Alan L. Rector
JIIS
2000
111views more  JIIS 2000»
13 years 7 months ago
Multidimensional Index Structures in Relational Databases
Abstract. Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on effi...
Christian Böhm, Stefan Berchtold, Hans-Peter ...
ICFP
2001
ACM
14 years 7 months ago
Down with Emacs Lisp: Dynamic Scope Analysis
It is possible to translate code written in Emacs Lisp or another Lisp dialect which uses dynamic scoping to a more modern programming language with lexical scoping while largely ...
Matthias Neubauer, Michael Sperber
AMW
2010
13 years 9 months ago
Chasing after Secrets in Relational Databases
Abstract. Inference control can guarantee confidentiality but is costly to implement. Access control can be implemented efficiently but cannot guarantee confidentiality. Hence, it ...
Joachim Biskup, Sven Hartmann, Sebastian Link, Jan...