Citation Context

...mapped, and 19 were correctly answered. Efforts on user-friendly exploration of structured data include keyword search over relational databases (Bhalotia et al., 2002) and structured keyword search (=-=Pound et al., 2010-=-). The latter is a compromise between full natural language and structured queries, where the user provides the structure and the system takes care of the disambiguation of keyword phrases. Our joint ...

Citation Context

...7] presents a probabilistic algorithm for annotating parts of keyword queries with table names, attribute names, and selection predicates on a set of product catalogs. A related problem is tackled in =-=[15]-=- where a keyword query over an Ontology is broken into a structured query over the entity, types, and relationships in the Ontology. A database of web tables is entirely different from such databases:...

Citation Context

...esentation. Note that keyword search is usually not a viable alternative when the information need involves joining multiple triples to construct the final result, not withstanding good attempts like =-=[12]-=-. In the example, the obvious keyword query “female actress Casablanca married writer born Rome” lacks a clear specification of the relations that should connect the different entities. Natural-langua...

Citation Context

...der to make user interactions as easy as possible, the system has to understand natural-language questions—a hard problem on which some progress has been made in the last few years (see, for example, =-=[10, 12]-=-). The questions need to be mapped to a query language in order to make the processing more precise and efficient, but there will be parts of the question which may not map to any structure. We believ...

Citation Context

... type guitarist {"awarded Grammy } Award"} . Table 4: Examples of query generation and relaxation Pound et al. [34] telegraphic query workload 1.0 tured predicates. Recent work on telegraphic queries =-=[11, 33, 34, 37]-=- pursues this very goal of translating such user requests into SQL or SPARQL queries. The focus here is on long keyword queries that describe entities or contain relational phrases that connect differ...

Citation Context

... Semantic Search 23 The hybrid search systems of which we are aware either all require structured queries rather than free-form queries [1, 13–15], require a “keyword-based structured query language” =-=[16]-=-, or require queries that are an extension of formal conjunctive queries [17, 18]. The structured query hybrid systems do, however, have retrieval and ranking mechanisms similar to those in HyKSS. The...

Citation Context

...ummarized below. Sarkas et al. [33] annotated e-commerce queries using schema and data in a structured product catalog. In the context of Web-extracted knowledge bases such as YAGO [35], Pound et al. =-=[29, 28]-=- set up a collective assignment problem with a cost model that reflects syntactic similarity between query fragments and their assigned concepts, as well as semantic coherence between concepts [20]. S...

Citation Context

...hips from unstructured information and represent them, for example, using RDF or even relational schemas. Structured queries are then run on the structured data, by systems such as Naga [12], [3] and =-=[17]-=-. However, the number of extracted relationships are limited, and the integration of unstructured and structured information is limited. See Section 6 for more details. The ERQ system [14, 15] has wor...