Sciweavers

183 search results - page 7 / 37
» Query Processing in Tertiary Memory Databases
Sort
View
DASFAA
2009
IEEE
123views Database» more  DASFAA 2009»
15 years 4 months ago
A Reprocessing Model Based on Continuous Queries for Writing Data to RFID Tag Memory
This paper investigates the problem of writing data to passive RFID tag memory and proposes a reprocessing model for assuring the atomicity and durability of writing transactions i...
Wooseok Ryu, Bonghee Hong
CIDR
2009
152views Algorithms» more  CIDR 2009»
14 years 10 months ago
Visualizing the robustness of query execution
In database query processing, actual run-time conditions (e.g., actual selectivities and actual available memory) very often differ from compile-time expectations of run-time cond...
Goetz Graefe, Harumi A. Kuno, Janet L. Wiener
SSD
1999
Springer
97views Database» more  SSD 1999»
15 years 1 months ago
A Performance Evaluation of Spatial Join Processing Strategies
We provide an evaluation of query execution plans (QEP) in the case of queries with one or two spatial joins. The QEPs assume R -tree indexed relations and use a common set of spat...
Apostolos Papadopoulos, Philippe Rigaux, Michel Sc...
ICDE
2008
IEEE
132views Database» more  ICDE 2008»
15 years 11 months ago
The Space Complexity of Processing XML Twig Queries Over Indexed Documents
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
Mirit Shalem, Ziv Bar-Yossef
PVLDB
2010
117views more  PVLDB 2010»
14 years 8 months ago
Building Disclosure Risk Aware Query Optimizers for Relational Databases
Many DBMS products in the market provide built in encryption support to deal with the security concerns of the organizations. This solution is quite effective in preventing data ...
Mustafa Canim, Murat Kantarcioglu, Bijit Hore, Sha...