Sciweavers

6568 search results - page 1228 / 1314
» Reducing the Complexity of Reductions
Sort
View
POPL
2004
ACM
16 years 6 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford
OSDI
2008
ACM
16 years 6 months ago
Automating Network Application Dependency Discovery: Experiences, Limitations, and New Solutions
Abstract ? Large enterprise networks consist of thousands of services and applications. The performance and reliability of any particular application may depend on multiple service...
Xu Chen, Ming Zhang, Zhuoqing Morley Mao, Paramvir...
ICALP
2009
Springer
16 years 6 months ago
Annotations in Data Streams
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
Amit Chakrabarti, Graham Cormode, Andrew McGregor
VLDB
2007
ACM
166views Database» more  VLDB 2007»
16 years 6 months ago
Supporting Time-Constrained SQL Queries in Oracle
The growing nature of databases, and the flexibility inherent in the SQL query language that allows arbitrarily complex formulations, can result in queries that take inordinate am...
Ying Hu, Seema Sundara, Jagannathan Srinivasan
SIGMOD
2009
ACM
136views Database» more  SIGMOD 2009»
16 years 6 months ago
A comparison of approaches to large-scale data analysis
There is currently considerable enthusiasm around the MapReduce (MR) paradigm for large-scale data analysis [17]. Although the basic control flow of this framework has existed in ...
Andrew Pavlo, Erik Paulson, Alexander Rasin, Danie...
« Prev « First page 1228 / 1314 Last » Next »