Award Abstract # 1420941
III: Small: Collaborative Research: The Package Query Paradigm

NSF Org: IIS
Division of Information & Intelligent Systems
Recipient: NEW YORK UNIVERSITY
Initial Amendment Date: August 29, 2014
Latest Amendment Date: July 21, 2015
Award Number: 1420941
Award Instrument: Continuing Grant
Program Manager: Maria Zemankova
IIS
 Division of Information & Intelligent Systems
CSE
 Directorate for Computer and Information Science and Engineering
Start Date: September 1, 2014
End Date: August 31, 2018 (Estimated)
Total Intended Award Amount: $248,603.00
Total Awarded Amount to Date: $248,603.00
Funds Obligated to Date: FY 2014 = $164,038.00
FY 2015 = $84,565.00
History of Investigator:
  • Azza Abouzied (Principal Investigator)
    azza@nyu.edu
Recipient Sponsored Research Office: New York University
70 WASHINGTON SQ S
NEW YORK
NY  US  10012-1019
(212)998-2121
Sponsor Congressional District: 10
Primary Place of Performance: New York University
P.O. Box 129188
Abu Dhabi
 AE
Primary Place of Performance
Congressional District:
Unique Entity Identifier (UEI): NX9PXMKW5KW8
Parent UEI:
NSF Program(s): Info Integration & Informatics
Primary Program Source: 01001415DB NSF RESEARCH & RELATED ACTIVIT
01001516DB NSF RESEARCH & RELATED ACTIVIT
Program Reference Code(s): 7364, 7923
Program Element Code(s): 736400
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.070

ABSTRACT

More data is available today than ever before, and this availability has enabled groundbreaking new applications and societal advances. However, today's computing technology that stores, organizes, and searches data is struggling to keep up to the demands imposed by the data's growth and by the requirements of new applications. Data management systems need to adapt to support the evolving information needs of modern applications. This project will extend data management technology to support constrained search for collections of data items that satisfy complex requirements. The need for this functionality arises in many domains: Online marketplaces group products into meaningful collections based on customer preferences, travel agents organize vacation packages that coordinate travel and hotel reservations, and dietitians design meal plans that satisfy complex nutritional needs. Currently, such applications have to resort to ad hoc solutions that lead to suboptimal results and poor performance.

This project will establish the theoretical foundations and will address practical aspects of providing support for packages. A package is a group of data items that collectively satisfy a set of constraints. This project will extend data management technology to provide full-fledged support for packages, and will make contributions on three fronts: (1) a declarative language to support querying for packages, (2) evaluation strategies to efficiently compute answers to package queries, and (3) interaction techniques for package specification. The broader impact of this work will be the advancement of data management technology to handle emerging application needs, which in turn will increase the positive impact that data and computing systems have on society.

For further information see the project web site at:  http://packagebuilder.cs.umass.edu

PUBLICATIONS PRODUCED AS A RESULT OF THIS RESEARCH

Note:  When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

(Showing: 1 - 10 of 12)
Brucato, Matteo and Beltran, Juan Felipe and Abouzied, Azza and Meliou, Alexandra "Scalable Package Queries in Relational Database Systems" Proc. VLDB Endow. , v.9 , 2016 , p.576--587 10.14778/2904483.2904489
Brucato, Matteo and Ramakrishna, Rahul and Abouzied, Azza and Meliou, Alexandra "PackageBuilder: From Tuples to Packages" Proc. VLDB Endow. , v.7 , 2014 , p.1593--159 10.14778/2733004.2733038
Juan Felipe Beltran, Aysha Siddique, Azza Abouzied, Jay Chen "Codo: Fundraising with Conditional Donations" UIST , 2015 , p.213 10.1145/2807442.2807509
Juan Felipe Beltran, Ziqi Huang, Azza Abouzied, Arnab Nandi "Don't Just Swipe Left, Tell Me Why: Enhancing Gesture-based Feedback with Reason Bins" IUI , 2017 , p.469 10.1145/3025171.3025212
Maeda F. Hanafi, Azza Abouzied, Laura Chiticariu, and Yunyao Li "SEER: Auto-Generating Information Extraction Rules from User-Specified Examples" CHI , 2017 10.1145/3025453.3025540
Maeda F. Hanafi, Azza Abouzied, Laura Chiticariu, Yunyao Li "SEER: Auto-Generating Information Extraction Rules from User-Specified Examples" CHI , 2017 , p.6672 10.1145/3025453.3025540
Matteo Brucato, Azza Abouzied, Alexandra Meliou "A Scalable Execution Engine for Package Queries" SIGMOD Record , v.46 , 2017 , p.24 10.1145/3093754.3093761
Matteo Brucato, Azza Abouzied, Alexandra Meliou "Package queries: efficient and scalable computation of high-order constraints" The VLDB Journal , v.27 , 2018 , p.693 10.1007/s00778-017-0483-4
Matteo Brucato, Azza Abouzied, and Alexandra Meliou "A Scalable Execution Engine for Package Queries" SIGMOD Record , v.46 , 2017 10.1145/3093754.3093761
Matteo Brucato, Juan Felipe Beltran, Azza Abouzied, Alexandra Meliou "Scalable Package Queries in Relational Database Systems" PVLDB , v.9 , 2016 10.14778/2904483.2904489
Matteo Brucato, Juan Felipe Beltran, Azza Abouzied, Alexandra Meliou "Scalable Package Queries in Relational Database Systems" VLDB , v.9 , 2016 , p.576 10.14778/2904483.2904489
(Showing: 1 - 10 of 12)

PROJECT OUTCOMES REPORT

Disclaimer

This Project Outcomes Report for the General Public is displayed verbatim as submitted by the Principal Investigator (PI) for this award. Any opinions, findings, and conclusions or recommendations expressed in this Report are those of the PI and do not necessarily reflect the views of the National Science Foundation; NSF has not approved or endorsed its content.

 

Constrained optimization problems are at the heart of significant applications in a broad range of domains, including finance, transportation, manufacturing, and healthcare. Modeling and solving these problems has relied on application-specific solutions, which are often complex, error-prone, and do not generalize. This project has introduced a domain-independent, declarative approach, supported and powered by the system where the data relevant to these problems typically resides: the database. The contributions include an end-to-end system to support package queries, a new query model that extends traditional database queries to handle complex constraints and preferences over answer sets, allowing the declarative specification and efficient evaluation of a significant class of constrained optimization problems—integer linear programs—within a database.  

Intellectual Merit: The project introduced a new data processing paradigm, package queries, which captures a variety of practical, real-world problems that require groups of data items to satisfy constraints collectively. Package queries are defined over traditional relations, but return packages or sets of tuples instead of tuples. This project developed language extensions to traditional database queries, to allow for the declarative specification of package constraints, and produced a method for automatically translating the declarative specification of a package query into a mathematical formulation that can be evaluated by existing constrained optimization tools. Moreover, the project developed scalable package evaluation algorithms with approximation guarantees, and parallelization techniques. This project has moved constrained optimization analysis closer to the data, eliminating the complexity of data extraction and transformation, development of custom, error-prone, and non-generalizable solutions, and loading of results into the database.

Broader Impacts: This project is a significant contribution to the topic of in-database analytics, simplifying workflows and facilitating domain experts’ access to specialized problem-solving capabilities. These advances remove data use barriers for significant groups of data users. The project fostered a new collaboration between two junior PIs, and formed the bulk of the dissertation work of one PhD student and supported several other PhD students, from groups traditionally under-represented in computer science. The project also involved several undergraduate students in research. Results from this project have been published in premier data management venues and have been recognized with several awards, including an ACM SIGMOD Research Highlight Award, a best of VLDB citation, a CHI best paper award and a Communications of the ACM Research Highlight.

 


Last Modified: 11/30/2018
Modified by: Azza Abouzied

Please report errors in award information by writing to: awardsearch@nsf.gov.

Print this page

Back to Top of page