Sciweavers

101 search results - page 7 / 21
» Query optimization techniques for partitioned tables
Sort
View
ICDE
2010
IEEE
201views Database» more  ICDE 2010»
13 years 7 months ago
Vertical partitioning of relational OLTP databases using integer programming
A way to optimize performance of relational row store databases is to reduce the row widths by vertically partitioning tables into table fractions in order to minimize the number ...
Rasmus Resen Amossen
WWW
2008
ACM
13 years 7 months ago
Divide, Compress and Conquer: Querying XML via Partitioned Path-Based Compressed Data Blocks
We propose a novel Partition Path-Based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called Block S...
Wilfred Ng, Ho Lam Lau, Aoying Zhou
ER
2007
Springer
99views Database» more  ER 2007»
14 years 1 months ago
VERT: A Semantic Approach for Content Search and Content Extraction in XML Query Processing
Processing a twig pattern query in XML document includes structural search and content search. Most existing algorithms only focus on structural search. They treat content nodes th...
Huayu Wu, Tok Wang Ling, Bo Chen
SIGMOD
1998
ACM
117views Database» more  SIGMOD 1998»
13 years 12 months ago
The Pyramid-Technique: Towards Breaking the Curse of Dimensionality
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
ICLP
2007
Springer
14 years 1 months ago
Logic Programming Approach to Automata-Based Decision Procedures
We propose a novel technique that maps decision problems in WS1S (weak monadic second-order logic with n successors) to the problem of query evaluation of Complex-value Datalog que...
Gulay Ünel, David Toman