Sciweavers

65 search results - page 10 / 13
» Efficient Support for Ordered XPath Processing in Tree-Unawa...
Sort
View
EDBT
2011
ACM
256views Database» more  EDBT 2011»
12 years 11 months ago
RanKloud: a scalable ranked query processing framework on hadoop
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
K. Selçuk Candan, Parth Nagarkar, Mithila N...
CCS
2009
ACM
14 years 8 months ago
Logging key assurance indicators in business processes
Management of a modern enterprise is based on the assumption that executive reports of lower-layer management are faithful to what is actually happening in the field. As some well...
Fabio Massacci, Gene Tsudik, Artsiom Yautsiukhin
DEXAW
2003
IEEE
131views Database» more  DEXAW 2003»
14 years 22 days ago
Having a BLAST: Analyzing Gene Sequence Data with BlastQuest
An essential problem for biologists is the processing and evaluation of BLAST results. We advocate the deployment of database technology and describe a userdriven tool, called Bla...
William G. Farmerie, Joachim Hammer, Li Liu, Marku...
ICDE
1993
IEEE
116views Database» more  ICDE 1993»
13 years 11 months ago
The Volcano Optimizer Generator: Extensibility and Efficient Search
Emerging database application domains demand not only new functionality but also high performance. To satisfy these two requirements, the Volcano project provides efficient, exten...
Goetz Graefe, William J. McKenna
VLDB
1995
ACM
97views Database» more  VLDB 1995»
13 years 11 months ago
Processing Object-Oriented Queries with Invertible Late Bound Functions
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
Staffan Flodin, Tore Risch