Sciweavers

513 search results - page 42 / 103
» Cache Conscious Algorithms for Relational Query Processing
Sort
View
182
Voted
VLDB
2003
ACM
123views Database» more  VLDB 2003»
15 years 10 months ago
A case for fractured mirrors
The Decomposition Storage Model (DSM) vertically partitions all attributes of a given relation. DSM has excellent I/O behavior when the number of attributes touched in the query i...
Ravishankar Ramamurthy, David J. DeWitt, Qi Su
99
Voted
ICDT
2012
ACM
226views Database» more  ICDT 2012»
13 years 2 days ago
Factorised representations of query results: size bounds and readability
We introduce a representation system for relational data based on algebraic factorisation using distributivity of product over union and commutativity of product and union. We giv...
Dan Olteanu, Jakub Zavodny
181
Voted
ICDE
2008
IEEE
162views Database» more  ICDE 2008»
15 years 11 months ago
Adaptive Approximate Similarity Searching through Metric Social Networks
Exploiting the concepts of social networking represents a novel approach to the approximate similarity query processing. We present a metric social network where relations between...
Jan Sedmidubský, Pavel Zezula, Stanislav Ba...
DATESO
2008
131views Database» more  DATESO 2008»
14 years 11 months ago
Towards Cost-based Optimizations of Twig Content-based Queries
Abstract In recent years, many approaches to indexing XML data have appeared. These approaches attempt to process XML queries efficiently and sufficient query plans are built for t...
Michal Krátký, Radim Baca
WSDM
2009
ACM
198views Data Mining» more  WSDM 2009»
15 years 4 months ago
Measuring the similarity between implicit semantic relations using web search engines
Measuring the similarity between implicit semantic relations is an important task in information retrieval and natural language processing. For example, consider the situation whe...
Danushka Bollegala, Yutaka Matsuo, Mitsuru Ishizuk...