Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Aaron Feng

dblp:220/3063 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
1since 2021 · last 2021
0009-0008-2918-1462ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 5 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
5 papers
Data models and query languages · 32% Query processing and optimization · 30% Information retrieval · 27%
Artificial intelligence
2 papers
Knowledge representation and reasoning · 100%

Topics — the 4 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge acquisition › knowledge extraction
declarative information extraction
0.722018
Koko: A System for Scalable Semantic Querying of Text · Proc. VLDB Endow. 2018
Scalable Semantic Querying of Text · Proc. VLDB Endow. 2018
Query processing and optimization
uncertain data query processing
0.512021
Querying subjective data · VLDB J. 2021
Information retrieval
query processing
0.412019
Subjective Databases · Proc. VLDB Endow. 2019
Recommender systems › domain-specific recommendation
travel recommendation
0.112019
Voyageur: An Experiential Travel Search Engine · WWW 2019

Methods — techniques the papers use, named apart from their topics

surface syntax conditions · 0.7natural language processing · 0.7dependency parse tree · 0.7ranking · 0.4phrase matching · 0.4experiential search · 0.4
YearPublicationVenuePosition
2021 Querying subjective data
Yuliang Li 0001, Aaron Feng, Saran Mumick, Alon Y. Halevy, Vivian Li, Wang Chiew Tan
VLDB J.2
2019 Voyageur: An Experiential Travel Search Engine
abstract
We describe Voyageur, which is an application of experiential search to the domain of travel. Unlike traditional search engines for online services, experiential search focuses on the experiential aspects of the service under consideration. In particular, Voyageur needs to handle queries for subjective aspects of the service (e.g., quiet hotel, friendly staff) and combine these with objective attributes, such as price and location. Voyageur also highlights interesting facts and tips about the services the user is considering to provide them with further insights into their choices.
Sara Evensen, Aaron Feng, Alon Y. Halevy, Vivian Li, Yuliang Li 0001, Huining Liu, George A. Mihaila, John Morales, Natalie Nuno, Ekaterina Pavlovic, Wang Chiew Tan, Xiaolan Wang 0001
WWW2
2019 Subjective Databases
abstract
Online users are constantly seeking experiences, such as a hotel with clean rooms and a lively bar, or a restaurant for a romantic rendezvous. However, e-commerce search engines only support queries involving objective attributes such as location, price, and cuisine, and any experiential data is relegated to text reviews. In order to support experiential queries, a database system needs to model subjective data. Users should be able to pose queries that specify subjective experiences using their own words, in addition to conditions on the usual objective attributes. This paper introduces OpineDB, a subjective database system that addresses these challenges. We introduce a data model for subjective databases. We describe how OpineDB translates subjective queries against the subjective database schema, which is done by matching the user query phrases to the underlying schema. We also show how the experiential conditions specified by the user can be combined and the results aggregated and ranked. We demonstrate that subjective databases satisfy user needs more effectively and accurately than alternative techniques through experiments with real data of hotel and restaurant reviews.
Yuliang Li 0001, Aaron Feng, Saran Mumick, Alon Y. Halevy, Vivian Li, Wang Chiew Tan
Proc. VLDB Endow.2
2018 Scalable Semantic Querying of Text
abstract
We present the Koko system that takes declarative information extraction to a new level by incorporating advances in natural language processing techniques in its extraction language. K oko is novel in that its extraction language simultaneously supports conditions on the surface of the text and on the structure of the dependency parse tree of sentences, thereby allowing for more refined extractions. K oko also supports conditions that are forgiving to linguistic variation of expressing concepts and allows to aggregate evidence from the entire document in order to filter extractions. To scale up, K oko exploits a multi-indexing scheme and heuristics for efficient extractions. We extensively evaluate K oko over publicly available text corpora. We show that K oko indices take up the smallest amount of space, are notably faster and more effective than a number of prior indexing schemes. Finally, we demonstrate K oko 's scalability on a corpus of 5 million Wikipedia articles.
Xiaolan Wang 0001, Aaron Feng, Behzad Golshan, Alon Y. Halevy, George A. Mihaila, Hidekazu Oiwa, Wang Chiew Tan
Proc. VLDB Endow.2
2018 Koko: A System for Scalable Semantic Querying of Text
abstract
K oko is a declarative information extraction system that incorporates advances in natural language processing techniques in its extraction language. K oko 's extraction language supports simultaneous specification of conditions over the surface syntax and on the structure of the dependency parse tree of sentences, thereby allowing for more refined extractions. Furthermore, the K oko extraction language allows for aggregating evidence from an input document and supports conditions that are tolerant of linguistic variation of expressing concepts. In this demo, we outline the design of K oko , a system for extracting information and understanding the results of the extraction. K oko provides an interactive interface that allows participants to write queries, understand the input and results of the queries. In particular, the user can customize the input text, visualize the input text's dependency parse trees, and understand the correspondences between query components, dependency tree nodes, text tokens, and the computation and associated scores that led to an extraction.
Xiaolan Wang 0001, Jiyu Komiya, Yoshihiko Suhara, Aaron Feng, Behzad Golshan, Alon Y. Halevy, Wang Chiew Tan
Proc. VLDB Endow.4