Sciweavers

716 search results - page 129 / 144
» Optimizing Queries in Extended Relational Databases
Sort
View
SIGMOD
2008
ACM
123views Database» more  SIGMOD 2008»
15 years 11 months ago
Query-based partitioning of documents and indexes for information lifecycle management
Regulations require businesses to archive many electronic documents for extended periods of time. Given the sheer volume of documents and the response time requirements, documents...
Soumyadeb Mitra, Marianne Winslett, Windsor W. Hsu
VLDB
2005
ACM
85views Database» more  VLDB 2005»
15 years 4 months ago
Pattern Tree Algebras: Sets or Sequences?
XML and XQuery semantics are very sensitive to the order of the produced output. Although pattern-tree based algebraic approaches are becoming more and more popular for evaluating...
Stelios Paparizos, H. V. Jagadish
PODS
2003
ACM
158views Database» more  PODS 2003»
15 years 11 months ago
Computing full disjunctions
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
Yaron Kanza, Yehoshua Sagiv
ICDE
2010
IEEE
408views Database» more  ICDE 2010»
15 years 6 months ago
Hive - a petabyte scale data warehouse using Hadoop
— The size of data sets being collected and analyzed in the industry for business intelligence is growing rapidly, making traditional warehousing solutions prohibitively expensiv...
Ashish Thusoo, Joydeep Sen Sarma, Namit Jain, Zhen...
POPL
2010
ACM
15 years 8 months ago
Generating Compiler Optimizations from Proofs
We present an automated technique for generating compiler optimizations from examples of concrete programs before and after improvements have been made to them. The key technical ...
Ross Tate, Michael Stepp, Sorin Lerner