Sciweavers

707 search results - page 123 / 142
» Processing queries on tree-structured data efficiently
Sort
View
PVLDB
2008
116views more  PVLDB 2008»
13 years 8 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
SIGMOD
2009
ACM
213views Database» more  SIGMOD 2009»
14 years 8 months ago
Dictionary-based order-preserving string compression for main memory column stores
Column-oriented database systems [19, 23] perform better than traditional row-oriented database systems on analytical workloads such as those found in decision support and busines...
Carsten Binnig, Stefan Hildenbrand, Franz Fär...
SIGMOD
2009
ACM
161views Database» more  SIGMOD 2009»
14 years 8 months ago
Automated SQL tuning through trial and (sometimes) error
SQL tuning--the attempt to improve a poorly-performing execution plan produced by the database query optimizer-is a critical aspect of database performance tuning. Ironically, as ...
Herodotos Herodotou, Shivnath Babu
VLDB
1989
ACM
114views Database» more  VLDB 1989»
14 years 20 days ago
Extending the Relational Algebra to Capture Complex Objects
An important direction in database research for non-standard applications (e.g. engineering or design applications) deals with adequate support for complex objects. Without doubt,...
Bernhard Mitschang
IPPS
2010
IEEE
13 years 6 months ago
pFANGS: Parallel high speed sequence mapping for Next Generation 454-roche Sequencing reads
Millions of DNA sequences (reads) are generated by Next Generation Sequencing machines everyday. There is a need for high performance algorithms to map these sequences to the refer...
Sanchit Misra, Ramanathan Narayanan, Wei-keng Liao...