Back to Results
First PageMeta Content
Computer performance / Query throughput / Extension / Tuple / Throughput / Join / Computing / Mean / Scheduling / Mathematics / Data management / Operations research


Achieving High Freshness and Optimal Throughput in CPU-limited Execution of Multi-Join Continuous Queries⋆ Abhishek Mukherji and Elke A. Rundensteiner and Matthew O. Ward Computer Science Department, Worcester Polytech
Add to Reading List

Document Date: 2011-05-26 16:03:02

Open Document

File Size: 237,51 KB

Share Result on Facebook

City

Tokyo / path productivity / Greedy Path Productivity / /

Company

Data Stream Management Systems / ABC / PathI Resources / tA SA / Google / X SA / /

/

Facility

Worcester Polytechnic Institute / /

IndustryTerm

minimum computing resources / integrated solution / continuous query systems / jth operator / real-time decision support / greedy algorithm / real-time applications / real world applications / root operator / stock trader / /

Organization

Division of Resources / National Science Foundation / Worcester Polytechnic Institute / U.S. Securities and Exchange Commission / Matthew O. Ward Computer Science Department / /

Person

Matthew O. Ward / Elke A. Rundensteiner / Abhishek Mukherji / /

Position

stock trader / trader / producer / /

Product

JDAM / /

ProvinceOrState

Michigan / /

Technology

JAQPOT algorithm / greedy algorithm / /

SocialTag