default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShaleen Deep
Person information
- affiliation: Microsoft Gray Systems Lab., USA
- affiliation: University of Wisconsin, Madison, WI, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Hangdong Zhao
, Shaleen Deep, Paraschos Koutris, Sudeepa Roy, Val Tannen:
Evaluating Datalog over Semirings: A Grounding-based Approach. Proc. ACM Manag. Data 2(2): 90 (2024)- [j13]Shaleen Deep, Hangdong Zhao, Austen Z. Fan, Paraschos Koutris:
Output-sensitive Conjunctive Query Evaluation. Proc. ACM Manag. Data 2(5): 220:1-220:24 (2024) - [j12]Yunjia Zhang, Jordan Henkel, Avrilia Floratou, Joyce Cahoon, Shaleen Deep, Jignesh M. Patel:
ReAcTable: Enhancing ReAct for Table Question Answering. Proc. VLDB Endow. 17(8): 1981-1994 (2024) - [j11]Zifan Liu, Shaleen Deep, Anna Fariha, Fotis Psallidas, Ashish Tiwari, Avrilia Floratou:
Rapidash: Efficient Detection of Constraint Violations. Proc. VLDB Endow. 17(8): 2009-2021 (2024) - [c12]Avrilia Floratou, Fotis Psallidas, Fuheng Zhao, Shaleen Deep, Gunther Hagleither, Wangda Tan, Joyce Cahoon, Rana Alotaibi, Jordan Henkel, Abhik Singla, Alex Van Grootel, Brandon Chow, Kai Deng, Katherine Lin, Marcos Campos, K. Venkatesh Emani, Vivek Pandit, Victor Shnayder, Wenjing Wang, Carlo Curino:
NL2SQL is a solved problem... Not! CIDR 2024 - [c11]Hangdong Zhao, Paraschos Koutris, Shaleen Deep:
Evaluating Datalog via Structure-Aware Rewriting. Datalog 2024: 48-53 - [i17]Hangdong Zhao, Shaleen Deep, Paraschos Koutris, Sudeepa Roy, Val Tannen:
Evaluating Datalog over Semirings: A Grounding-based Approach. CoRR abs/2403.12436 (2024) - [i16]Shaleen Deep, Hangdong Zhao, Austen Z. Fan, Paraschos Koutris:
Output-sensitive Conjunctive Query Evaluation. CoRR abs/2406.07847 (2024) - 2023
- [j10]Ling Zhang, Shaleen Deep, Avrilia Floratou, Anja Gruenheid, Jignesh M. Patel, Yiwen Zhu:
Exploiting Structure in Regular Expression Queries. Proc. ACM Manag. Data 1(2): 152:1-152:28 (2023) - [j9]Paraschos Koutris, Shaleen Deep:
The Fine-Grained Complexity of CFL Reachability. Proc. ACM Program. Lang. 7(POPL): 1713-1739 (2023) - [c10]Hangdong Zhao, Shaleen Deep, Paraschos Koutris:
Space-Time Tradeoffs for Conjunctive Queries with Access Patterns. PODS 2023: 59-68 - [c9]Shaleen Deep, Xiao Hu, Paraschos Koutris:
General Space-Time Tradeoffs via Relational Queries. WADS 2023: 309-325 - [i15]Hangdong Zhao, Shaleen Deep, Paraschos Koutris:
Space-Time Tradeoffs for Conjunctive Queries with Access Patterns. CoRR abs/2304.06221 (2023) - [i14]Anirudh Khatry, Joyce Cahoon, Jordan Henkel, Shaleen Deep, K. Venkatesh Emani, Avrilia Floratou, Sumit Gulwani, Vu Le, Mohammad Raza, Sherry Shi, Mukul Singh, Ashish Tiwari:
From Words to Code: Harnessing Data for Program Synthesis from Natural Language. CoRR abs/2305.01598 (2023) - [i13]Paraschos Koutris, Shaleen Deep:
The Fine-Grained Complexity of CFL Reachability. CoRR abs/2308.09284 (2023) - [i12]Zifan Liu, Shaleen Deep, Anna Fariha, Fotis Psallidas, Ashish Tiwari, Avrilia Floratou:
Rapidash: Efficient Constraint Discovery via Rapid Verification. CoRR abs/2309.12436 (2023) - [i11]Yunjia Zhang, Jordan Henkel, Avrilia Floratou, Joyce Cahoon, Shaleen Deep, Jignesh M. Patel:
ReAcTable: Enhancing ReAct for Table Question Answering. CoRR abs/2310.00815 (2023) - [i10]Xi Wu, Xiangyao Yu, Shaleen Deep, Ahmed Mahmood, Uyeong Jang, Stratis Viglas, Somesh Jha, John Cieslewicz, Jeffrey F. Naughton:
Bilevel Relations and Their Applications to Data Insights. CoRR abs/2311.04824 (2023) - 2022
- [j8]Shaleen Deep, Anja Gruenheid, Kruthi Nagaraj, Hiro Naito, Jeffrey F. Naughton, Stratis Viglas:
DIAMETRICS: benchmarking query engines at scale. Commun. ACM 65(12): 105-112 (2022) - [j7]Shaleen Deep, Anja Gruenheid, Paraschos Koutris, Stratis Viglas, Jeffrey F. Naughton:
Comprehensive and Efficient Workload Summarization. Datenbank-Spektrum 22(3): 249-256 (2022) - [j6]Shaleen Deep, Xiao Hu, Paraschos Koutris:
Ranked Enumeration of Join Queries with Projections. Proc. VLDB Endow. 15(5): 1024-1037 (2022) - [i9]Shaleen Deep, Xiao Hu, Paraschos Koutris:
Ranked Enumeration of Join Queries with Projections. CoRR abs/2201.05566 (2022) - 2021
- [j5]Shaleen Deep, Anja Gruenheid, Kruthi Nagaraj, Hiro Naito, Jeffrey F. Naughton, Stratis Viglas:
DIAMetrics: Benchmarking Query Engines at Scale. SIGMOD Rec. 50(1): 24-31 (2021) - [c8]Shaleen Deep, Paraschos Koutris:
Ranked Enumeration of Conjunctive Query Results. ICDT 2021: 5:1-5:19 - [c7]Shaleen Deep, Xiao Hu, Paraschos Koutris:
Enumeration Algorithms for Conjunctive Queries with Projection. ICDT 2021: 14:1-14:17 - [i8]Shaleen Deep, Xiao Hu, Paraschos Koutris:
Enumeration Algorithms for Conjunctive Queries with Projection. CoRR abs/2101.03712 (2021) - [i7]Shaleen Deep, Xiao Hu, Paraschos Koutris:
Space-Time Tradeoffs for Answering Boolean Conjunctive Queries. CoRR abs/2109.10889 (2021) - 2020
- [j4]Anja Gruenheid, Shaleen Deep, Kruthi Nagaraj, Hiro Naito, Jeffrey F. Naughton, Stratis Viglas:
DIAMetrics: Benchmarking Query Engines at Scale. Proc. VLDB Endow. 13(12): 3285-3298 (2020) - [j3]Shaleen Deep, Anja Gruenheid, Paraschos Koutris, Jeffrey F. Naughton, Stratis Viglas:
Comprehensive and Efficient Workload Compression. Proc. VLDB Endow. 14(3): 418-430 (2020) - [c6]Shaleen Deep, Xiao Hu, Paraschos Koutris:
Fast Join Project Query Evaluation using Matrix Multiplication. SIGMOD Conference 2020: 1213-1223 - [i6]Shaleen Deep, Xiao Hu, Paraschos Koutris:
Fast Join Project Query Evaluation using Matrix Multiplication. CoRR abs/2002.12459 (2020) - [i5]Shaleen Deep, Anja Gruenheid, Paraschos Koutris, Jeffrey F. Naughton, Stratis Viglas:
Comprehensive and Efficient Workload Compression. CoRR abs/2011.05549 (2020)
2010 – 2019
- 2019
- [j2]Shuchi Chawla, Shaleen Deep, Paraschos Koutris, Yifeng Teng:
Revenue Maximization for Query Pricing. Proc. VLDB Endow. 13(1): 1-14 (2019) - [i4]Shaleen Deep, Paraschos Koutris:
Ranked Enumeration of Conjunctive Query Results. CoRR abs/1902.02698 (2019) - [i3]Shuchi Chawla, Shaleen Deep, Paraschos Koutris, Yifeng Teng:
Revenue Maximization for Query Pricing. CoRR abs/1909.00845 (2019) - 2018
- [c5]Shaleen Deep, Paraschos Koutris:
Compressed Representations of Conjunctive Query Results. PODS 2018: 307-322 - 2017
- [j1]Shaleen Deep, Paris Koutris, Yash Bidasaria:
QIRANA Demonstration: Real time Scalable Query Pricing. Proc. VLDB Endow. 10(12): 1949-1952 (2017) - [c4]Shaleen Deep, Paraschos Koutris:
The Design of Arbitrage-Free Data Pricing Schemes. ICDT 2017: 12:1-12:18 - [c3]Shaleen Deep, Paraschos Koutris:
QIRANA: A Framework for Scalable Query Pricing. SIGMOD Conference 2017: 699-713 - [i2]Shaleen Deep, Paraschos Koutris:
Compressed Representations of Conjunctive Query Results. CoRR abs/1709.06186 (2017) - 2016
- [i1]Shaleen Deep, Paraschos Koutris:
The Design of Arbitrage-Free Data Pricing Schemes. CoRR abs/1606.09376 (2016) - 2014
- [c2]Arjun Datt Sharma, Shaleen Deep:
Too Long-Didn't Read: A Practical Web Based Approach towards Text Summarization. ICAA 2014: 198-208 - [c1]Arjun Datt Sharma, Ansuya Ahluwalia, Shaleen Deep, Divya Bansal:
Friend or Foe: Twitter Users under Magnification. ICDCIT 2014: 251-262
Coauthor Index
aka: Paris Koutris
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
