Sciweavers

2237 search results - page 342 / 448
» Storing information with extractors
Sort
View
DAGSTUHL
2004
14 years 5 days ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
DATESO
2004
174views Database» more  DATESO 2004»
14 years 5 days ago
On Efficient Part-match Querying of XML Data
The XML language have been becoming de-facto a standard for representation of heterogeneous data in the Internet. From database point of view, XML is a new approach to data modelli...
Michal Krátký, Marek Andrt
DBA
2006
156views Database» more  DBA 2006»
14 years 5 days ago
Simulated Annealing for Materialized View Selection in Data Warehousing Environment
In order to facilitate query processing, the information contained in data warehouses is typically stored as a set of materialized views. Deciding which views to materialize prese...
Roozbeh Derakhshan, Frank K. H. A. Dehne, Othmar K...
DBSEC
2006
122views Database» more  DBSEC 2006»
14 years 5 days ago
A Framework for Flexible Access Control in Digital Library Systems
Traditional access control models are often found to be inadequate for digital libraries. This is because the user population for digital libraries is very dynamic and not complete...
Indrajit Ray, Sudip Chakraborty
ECEH
2006
155views Healthcare» more  ECEH 2006»
14 years 5 days ago
A Data Network for Health e-Research
: Sharing health data for research purposes across data custodian boundaries poses technical, organisational and ethical challenges. We describe a service oriented architecture for...
Kerry L. Taylor, Christine M. O'Keefe, John Colton...