• Publications
  • Influence
Monitoring k-nearest neighbor queries over moving objects
TLDR
We propose two methods to monitork-NN queries over moving objects. Expand
  • 341
  • 27
  • PDF
LSH Ensemble: Internet-Scale Domain Search
TLDR
We present a new index structure, Locality Sensitive Hashing (LSH) Ensemble, that solves the domain search problem using set containment at Internet scale. Expand
  • 39
  • 7
  • PDF
Keyword query cleaning
TLDR
We introduce the problem of query cleaning for keyword search queries in a database context and propose a set of effective and efficient solutions. Expand
  • 63
  • 5
  • PDF
Table Union Search on Open Data
TLDR
We define the table union search problem and present a probabilistic solution for finding tables that are unionable with a query table within massive repositories. Expand
  • 41
  • 4
  • PDF
Discovering Linkage Points over Web Data
TLDR
We present a framework consisting of a library of efficient lexical analyzers and similarity functions, and a set of search algorithms for effective and efficient identification of linkage points over Web data. Expand
  • 33
  • 4
  • PDF
Concise descriptions of subsets of structured sets
TLDR
We study the problem of economical representation of subsets of structured sets, that is, sets equipped with a set cover. Expand
  • 15
  • 3
  • PDF
Modeling and control of discrete-event systems with hierarchical abstraction
TLDR
We show that the high-level supervisor of Figure 2.19 (b) is in fact not controllable, and must be adjusted. Expand
  • 20
  • 2
Scalable Distributed Processing of K Nearest Neighbor Queries over Moving Objects
TLDR
We propose a new index structure called Dynamic Strip Index (DSI), which can better adapt to different data distributions than exiting grid indexes. Expand
  • 49
  • 1
  • PDF
Syntactic Rule Based Approach toWeb Service Composition
TLDR
This paper studies a problem of web service composition from a syntactic approach. Expand
  • 34
  • 1
  • PDF
Making Open Data Transparent: Data Discovery on Open Data
TLDR
We present new table join and table union search solutions that provide interactive search speed even over massive collections of millions of attributes with heavily skewed cardinality distributions. Expand
  • 9
  • 1
  • PDF