Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

89

WAIM
2007
Springer

91views Information Technology» more WAIM 2007»

Efficient Processing of Relational Queries with Sum Constraints

15 years 9 months ago

Efficient Processing of Relational Queries with Sum Constraints

Download people.cs.uchicago.edu

Svetlozar Nestorov, Chuang Liu, Ian T. Foster

Real-time Traffic

Information Management | WAIM 2007 |

claim paper

Related Content

» Relative Prefix Sums An Efficient Approach for Querying Dynamic OLAP Data Cubes

» Multisource Skyline Query Processing in Road Networks

» Efficient Relational Joins with Arithmetic Constraints on Multiple Attributes

» Efficient recursive XML query processing using relational database systems

» Structural Joins A Primitive for Efficient XML Query Pattern Matching

» Efficient Support for Ordered XPath Processing in TreeUnaware Commercial Relational Databa...

» Efficient join processing over uncertain data

» Efficient Query Processing on the Relational Quadtree

» Efficiently Processing Queries on IntervalandValue Tuples in Relational Databases

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	WAIM
Authors	Svetlozar Nestorov, Chuang Liu, Ian T. Foster

Comments (0)