Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJune 2016
Sample + Seek: Approximating Aggregates with Distribution Precision Guarantee
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataJune 2016, Pages 679–694https://doi.org/10.1145/2882903.2915249Data volumes are growing exponentially for our decision-support systems making it challenging to ensure interactive response time for ad-hoc queries without increasing cost of hardware. Aggregation queries with Group By that produce an aggregate value ...
- research-articleMay 2015
S4: Top-k Spreadsheet-Style Search for Query Discovery
SIGMOD '15: Proceedings of the 2015 ACM SIGMOD International Conference on Management of DataMay 2015, Pages 2001–2016https://doi.org/10.1145/2723372.2749452An enterprise information worker is often aware of a few example tuples that should be present in the output of the query. Query discovery systems have been developed to discover project-join queries that contain the given example tuples in their ...
- research-articleOctober 2014
Finding patterns in a knowledge base using keywords to compose table answers
Proceedings of the VLDB Endowment (PVLDB), Volume 7, Issue 14Pages 1809–1820https://doi.org/10.14778/2733085.2733088We aim to provide table answers to keyword queries using a knowledge base. For queries referring to multiple entities, like "Washington cities population" and "Mel Gibson movies", it is better to represent each relevant answer as a table which ...
- research-articleJune 2014
Discovering queries based on example tuples
SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of DataJune 2014, Pages 493–504https://doi.org/10.1145/2588555.2593664An enterprise information worker is often aware of a few example tuples (but not the entire result) that should be present in the output of the query. We study the problem of discovering the minimal project join query that contains the given example ...
- ArticleApril 2013
Data services for E-tailers leveraging web search engine assets
ICDE '13: Proceedings of the 2013 IEEE International Conference on Data Engineering (ICDE 2013)April 2013, Pages 1153–1164https://doi.org/10.1109/ICDE.2013.6544905Retail is increasingly moving online. There are only a few big e-tailers but there is a long tail of small-sized e-tailers. The big e-tailers are able to collect significant data on user activities at their websites. They use these assets to derive ...
- research-articleAugust 2012
A framework for robust discovery of entity synonyms
KDD '12: Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data miningAugust 2012, Pages 1384–1392https://doi.org/10.1145/2339530.2339743Entity synonyms are critical for many applications like information retrieval and named entity recognition in documents. The current trend is to automatically discover entity synonyms using statistical techniques on web data. Prior techniques suffer ...
- research-articleMay 2012
InfoGather: entity augmentation and attribute discovery by holistic matching with web tables
SIGMOD '12: Proceedings of the 2012 ACM SIGMOD International Conference on Management of DataMay 2012, Pages 97–108https://doi.org/10.1145/2213836.2213848The Web contains a vast corpus of HTML tables, specifically entity attribute tables. We present three core operations, namely entity augmentation by attribute name, entity augmentation by example and attribute discovery, that are useful for "information ...
- research-articleApril 2012
Targeted disambiguation of ad-hoc, homogeneous sets of named entities
WWW '12: Proceedings of the 21st international conference on World Wide WebApril 2012, Pages 719–728https://doi.org/10.1145/2187836.2187934In many entity extraction applications, the entities to be recognized are constrained to be from a list of "target entities". In many cases, these target entities are (i) ad-hoc, i.e., do not exist in a knowledge base and (ii) homogeneous (e.g., all the ...
- ArticleApril 2011
Interval-based pruning for top-k processing over compressed lists
ICDE '11: Proceedings of the 2011 IEEE 27th International Conference on Data EngineeringApril 2011, Pages 709–720https://doi.org/10.1109/ICDE.2011.5767855Optimizing execution of top-k queries over record-id ordered, compressed lists is challenging. The threshold family of algorithms cannot be effectively used in such cases. Yet, improving execution of such queries is of great value. For example, top-k ...
- posterMarch 2011
EntityTagger: automatically tagging entities with descriptive phrases
WWW '11: Proceedings of the 20th international conference companion on World wide webMarch 2011, Pages 19–20https://doi.org/10.1145/1963192.1963203We consider the problem of entity tagging: given one or more named entities from a specific domain, the goal is to automatically associate descriptive phrases, referred to as etags (entity tags), to each entity. Consider a product catalog containing ...
- demonstrationJune 2010
Query portals: dynamically generating portals for entity-oriented web queries
SIGMOD '10: Proceedings of the 2010 ACM SIGMOD International Conference on Management of dataJune 2010, Pages 1171–1174https://doi.org/10.1145/1807167.1807310Many web queries seek information about named entities (such as products or people). Web search engines federate such entity-oriented queries to relevant structured databases; the results of those searches are then returned to the user along with web ...
- research-articleApril 2009
Exploiting web search engines to search structured databases
WWW '09: Proceedings of the 18th international conference on World wide webApril 2009, Pages 501–510https://doi.org/10.1145/1526709.1526777Web search engines often federate many user queries to relevant structured databases. For example, a product related query might be federated to a product database containing their descriptions and specifications. The relevant structured data items are ...
- research-articleAugust 2008
Scalable ad-hoc entity extraction from text collections
Proceedings of the VLDB Endowment (PVLDB), Volume 1, Issue 1Pages 945–957https://doi.org/10.14778/1453856.1453958Supporting entity extraction from large document collections is important for enabling a variety of important data analysis tasks. In this paper, we introduce the "ad-hoc" entity extraction task where entities of interest are constrained to be from a ...
- research-articleJune 2008
An efficient filter for approximate membership checking
SIGMOD '08: Proceedings of the 2008 ACM SIGMOD international conference on Management of dataJune 2008, Pages 805–818https://doi.org/10.1145/1376616.1376697We consider the problem of identifying sub-strings of input text strings that approximately match with some member of a potentially large dictionary. This problem arises in several important applications such as extracting named entities from text ...
- ArticleJune 2004
Automatic categorization of query results
SIGMOD '04: Proceedings of the 2004 ACM SIGMOD international conference on Management of dataJune 2004, Pages 755–766https://doi.org/10.1145/1007568.1007653Exploratory ad-hoc queries could return too many answers - a phenomenon commonly referred to as "information overload". In this paper, we propose to automatically categorize the results of SQL queries to address this problem. We dynamically generate a ...