An evaluation of the strategies of sorting, filtering, and grouping API methods for code completion

D Hou, DM Pletcher - 2011 27th IEEE International Conference …, 2011 - ieeexplore.ieee.org
Code Completion is one of the most popular IDE features for accessing APIs, freeing
programmers from remembering specific details about an API and reducing keystrokes. We …

A stratified approach to progressive approximate joins

WH Tok, S Bressan, ML Lee - … of the 11th international conference on …, 2008 - dl.acm.org
Users often do not require a complete answer to their query but rather only a sample. They
expect the sample to be either the largest possible or the most representative (or both) given …

Progressive and approximate join algorithms on data streams

WH Tok, S Bressan - Advanced Query Processing: Volume 1: Issues and …, 2013 - Springer
In this chapter, we discuss the design and implementation of join algorithms for data
streaming systems, wherememory is often limited relative to the data that needs to be …

Viper: Interactive Exploration of Large Satellite Data✱✱

Z Shang, A Eldawy - Proceedings of the 18th International Symposium …, 2023 - dl.acm.org
Significant increase in high-resolution satellite data requires more productive analysis
methods to benefit data scientists. Interactive exploration is essential to productivity since it …

Optimally leveraging density and locality to support limit queries

A Kim, L Xu, T Siddiqui, S Huang, S Madden… - arXiv preprint arXiv …, 2016 - arxiv.org
Existing database systems are not optimized for queries with a LIMIT clause---operating
instead in an all-or-nothing manner. In this paper, we propose a fast LIMIT query evaluation …

On producing high and early result throughput in multijoin query plans

JK Levandoski, ME Khalefa… - IEEE transactions on …, 2010 - ieeexplore.ieee.org
This paper introduces an efficient framework for producing high and early result throughput
in multijoin query plans. While most previous research focuses on optimizing for cases …

Twig'n join: Progressive query processing of multiple XML streams

WH Tok, S Bressan, ML Lee - … , DASFAA 2008, New Delhi, India, March 19 …, 2008 - Springer
We propose a practical approach to the progressive processing of (FWR) XQuery queries on
multiple XML streams, called Twig'n Join (or TnJ). The query is decomposed into a query …

Danaides: Continuous and progressive complex queries on rss feeds

WH Tok, S Bressan, ML Lee - … , DASFAA 2007, Bangkok, Thailand, April 9 …, 2007 - Springer
Abstract RSS (Really Simple Syndication) is a format used for the publication and
syndication of web content. While several frameworks, techniques and algorithms have …

Progressive high-dimensional similarity join

WH Tok, S Bressan, ML Lee - … , September 3-7, 2007. Proceedings 18, 2007 - Springer
Abstract The Rate-Based Progressive Join (RPJ) is a non-blocking relational equijoin
algorithm. It is an equijoin that can deliver results progressively. In this paper, we first …

Twig'n join: Progressive query processing of multiple Xml streams

WH TOK, S BRESSAN, ML LEE - 2007 - dl.comp.nus.edu.sg
We propose a practical approach to the progressive processing of (FWR) XQuery queries on
multiple XML streams, called Twig. n Join (or TnJ). The query is decomposed into a query …