Sciweavers

513 search results - page 16 / 103
» Cache Conscious Algorithms for Relational Query Processing
Sort
View
SC
2004
ACM
14 years 25 days ago
Big Wins with Small Application-Aware Caches
Large datasets, on the order of GB and TB, are increasingly common as abundant computational resources allow practitioners to collect, produce and store data at higher rates. As d...
Julio C. López, David R. O'Hallaron, Tianka...
ADBIS
2001
Springer
115views Database» more  ADBIS 2001»
13 years 12 months ago
Interactive Constraint-Based Sequential Pattern Mining
Data mining is an interactive and iterative process. It is very likely that a user will execute a series of similar queries differing in pattern constraints and mining parameters,...
Marek Wojciechowski
SSD
1999
Springer
97views Database» more  SSD 1999»
13 years 11 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...
CIMCA
2008
IEEE
13 years 9 months ago
RIAL: Redundancy Reducing Inlining Algorithm to Map XML DTD to Relations
XML has emerged as a common standard for data exchange over the World Wide Web. One way to manage XML data is to use the power of relational databases for storing and q...
Amir Jahangard Rafsanjani, Seyed-Hassan Mirian-Hos...
WEBDB
2010
Springer
208views Database» more  WEBDB 2010»
13 years 5 months ago
XML-Based RDF Data Management for Efficient Query Processing
The Semantic Web, which represents a web of knowledge, offers new opportunities to search for knowledge and information. To harvest such search power requires robust and scalable ...
Mo Zhou, Yuqing Wu