Sciweavers

29 search results - page 3 / 6
» Real-Time Data Access Control on B-Tree Index Structures
Sort
View
SEMWEB
2007
Springer
14 years 1 months ago
Access Control for Sharing Semantic Data across Desktops
Abstract. Personal Information Management (PIM) systems aim to provide convenient access to all data and metadata on a desktop to the user itself as well as the co-workers. Obvious...
Ekaterini Ioannou, Juri Luca De Coi, Arne Wolf Koe...
BTW
2003
Springer
94views Database» more  BTW 2003»
14 years 20 days ago
The Paradigm of Relational Indexing: a Survey
Abstract: In order to achieve efficient execution plans for queries comprising userdefined data types and predicates, the database system has to be provided with appropriate index ...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
VLDB
1999
ACM
131views Database» more  VLDB 1999»
13 years 11 months ago
High-Performance Extensible Indexing
Today’s object-relational DBMSs (ORDBMSs) are designed to support novel application domains by providing an extensible architecture, supplemented by domain-specific database ex...
Marcel Kornacker
CINQ
2004
Springer
180views Database» more  CINQ 2004»
13 years 11 months ago
Interactivity, Scalability and Resource Control for Efficient KDD Support in DBMS
The conflict between resource consumption and query performance in the data mining context often has no satisfactory solution. This not only stands in sharp contrast to the need of...
Matthias Gimbel, Michael Klein, Peter C. Lockemann
IS
2011
13 years 2 months ago
Fully dynamic metric access methods based on hyperplane partitioning
Metric access methods based on hyperplane partitioning have the advantage, compared to the ballpartitioning-based ones, that regions do not overlap. The price is less flexibility...
Gonzalo Navarro, Roberto Uribe Paredes