Filters








250,374 Hits in 2.8 sec

Relational queries over interpreted structures

Michael Benedikt, Leonid Libkin
2000 Journal of the ACM  
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries.  ...  Under this semantics, quanti ers range over elements of a relational database.  ...  These state that generic queries de nable over interpreted structures can be de ned without additional interpreted operations.  ... 
doi:10.1145/347476.347477 fatcat:yflxg2h2onhvhccnlmuvdnzaf4

Interpreting keyword queries over web knowledge bases

Jeffrey Pound, Alexander K. Hudek, Ihab F. Ilyas, Grant Weddell
2012 Proceedings of the 21st ACM international conference on Information and knowledge management - CIKM '12  
Many keyword queries issued to Web search engines target information about real world entities, and interpreting these queries over Web knowledge bases can often enable the search system to provide exact  ...  In this work we present an approach to computing structured representations of keyword queries over a reference knowledge base.  ...  We omit structures containing more than one unknown relation to avoid the exponential blow-up caused by matching over all possible pairs of relations.  ... 
doi:10.1145/2396761.2396803 dblp:conf/cikm/PoundHIW12 fatcat:f4orrr2sk5djherpmhaikxk6km

Page 8497 of Mathematical Reviews Vol. , Issue 2002K [page]

2002 Mathematical Reviews  
interpreted structures.  ...  query, over all databases embedded in M, as ¢ under the natural interpretation.  ... 

Languages for relational databases over interpreted structures

Michael Benedikt, Leonid Libkin
1997 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '97  
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries.  ...  We give a set of normal forms for these logics, under special conditions on the interpreted structures.  ...  over interpreted structures.  ... 
doi:10.1145/263661.263672 dblp:conf/pods/BenediktL97 fatcat:ry2btuu4mbezpehnajywlmazpy

QUICK

Jeffrey Pound, Ihab F. Ilyas, Grant Weddell
2010 Proceedings of the VLDB Endowment  
A disambiguation procedure is run to compute the top ranking query interpretations in the form of a structured concept query over the KB.  ...  It contains over 2 million entities, about 250,000 primitive concepts, 100 relations, and over 20 million facts about these entities, concepts, and relations.  ... 
doi:10.14778/1920841.1921042 fatcat:f4xfkoyzfreczn3f6ub6bhpkly

Expressive and flexible access to web-extracted data

Jeffrey Pound, Ihab F. Ilyas, Grant Weddell
2010 Proceedings of the 2010 international conference on Management of data - SIGMOD '10  
We address this challenge by proposing a new query language that blends keyword search with structured query processing over large information graphs with rich semantics.  ...  Our formalism for structured queries based on keywords combines the flexibility of keyword search with the expressiveness of structures queries.  ...  RELATED WORK The problem of mapping keywords into structured data graphs has been studied in the context of keyword search over relational databases.  ... 
doi:10.1145/1807167.1807214 dblp:conf/sigmod/PoundIW10 fatcat:e23ybqeucjby7nh4tde4ijvre4

A DISTRIBUTIONAL STRUCTURED SEMANTIC SPACE FOR QUERYING RDF GRAPH DATA

ANDRÉ FREITAS, EDWARD CURRY, JOÃO GABRIEL OLIVEIRA, SEÁN O'RIAIN
2011 International Journal of Semantic Computing (IJSC)  
This article introduces a distributional structured semantic space which enables data model independent natural language queries over RDF data.  ...  The center of the approach relies on the use of a distributional semantic model to address the level of semantic interpretation demanded to build the data model independent approach.  ...  For queries over the ESA entity space, the ESA interpretation vector for the query is defined using the Universal ESA space.  ... 
doi:10.1142/s1793351x1100133x fatcat:4ws744oufnf65i632tpaqoapjq

Query languages with arithmetic and constraint databases

Leonid Libkin
1999 ACM SIGACT News  
" : FO(M; SC) denotes the class of queries on SC-structures denable in FO over M, under the natural interpretation; likewise, we use the notation FO act (M; SC) for the active interpretation.  ...  The interpretation under which 9x and 8x mean \exists x 2 U" and \for all x 2 U," where U is the in nite universe of a structure over which databases are interpreted, is called the natural semantics, or  ... 
doi:10.1145/337885.337894 fatcat:vpvwkahpkbhyhbxk5loodrdrme

A Multidimensional Semantic Space for Data Model Independent Queries over RDF Data

Andre Freitas, Joao Gabriel Oliveira, Edward Curry, Se´n O'Riain
2011 2011 IEEE Fifth International Conference on Semantic Computing  
This article introduces a multidimensional semantic space model which enables data model independent natural language queries over RDF data.  ...  The center of the approach relies on the use of a distributional semantic model to address the level of semantic interpretation demanded to build the data model independent approach.  ...  based on a semantic interpretation of query and dataset terms.  ... 
doi:10.1109/icsc.2011.89 dblp:conf/semco/FreitasOCO11 fatcat:wtl3o2ar7jhrbptp36ihkwiqt4

Safe constraint queries

Michael Benedikt, Leonid Libkin
1998 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '98  
, and where formulae over elements of that structure can be used in queries.  ...  We extend some of the classical characterization theorems of relational database theory | particularly those related to query safety | to the context where database elements come with xed interpreted structure  ...  In contrast, we show here that certain kinds of structural properties of relational calculus queries remain when a reasonable interpreted structure is present.  ... 
doi:10.1145/275487.275499 dblp:conf/pods/BenediktL98 fatcat:7ddwk6dmtngqplskaqpo567eam

Safe Constraint Queries

Michael Benedikt, Leonid Libkin
2000 SIAM journal on computing (Print)  
, and where formulae over elements of that structure can be used in queries.  ...  We extend some of the classical characterization theorems of relational database theory | particularly those related to query safety | to the context where database elements come with xed interpreted structure  ...  In contrast, we show here that certain kinds of structural properties of relational calculus queries remain when a reasonable interpreted structure is present.  ... 
doi:10.1137/s0097539798342484 fatcat:gyt2nckxm5cr7p4h6ercyoiela

Neural Architecture for Question Answering Using a Knowledge Graph and Web Corpus [article]

Uma Sawant, Saurabh Garg, Soumen Chakrabarti, Ganesh Ramakrishnan
2018 arXiv   pre-print
It may use a parser to interpret the question to a structured query, execute that on a knowledge graph (KG), and return direct entity responses.  ...  On four public query workloads, amounting to over 8,000 queries with diverse query syntax, we see 5--16% absolute improvement in mean average precision (MAP), compared to the entity ranking performance  ...  structured interpretations.  ... 
arXiv:1706.00973v3 fatcat:le523ev5u5bg3amdieimu43hgm

Improving the Understandability of OLAP Queries by Semantic Interpretations [chapter]

Carlos Molina, Belen Prados-Suárez, Miguel Prados de Reyes, Carmen Peña Yañez
2013 Lecture Notes in Computer Science  
Everyday methods providing managers with elaborated information making more comprehensible the results obtained of queries over OLAP systems are required.  ...  Here we go further and introduce a new mathematical formalism, the Semantic Interpretations, to supply the user not only understandable responses, but also semantically meaningful results.  ...  Conclusions In this paper we have introduced the new concept of Semantic Interpretation, that provides the OLAP systems with the new capability of querying about the same given item with different purposes  ... 
doi:10.1007/978-3-642-40769-7_16 fatcat:ajjhmggowjh2tie6c7pzho3rie

KEYRY: A Keyword-Based Search Engine over Relational Databases Based on a Hidden Markov Model [chapter]

Sonia Bergamaschi, Francesco Guerra, Silvia Rota, Yannis Velegrakis
2011 Lecture Notes in Computer Science  
We propose the demonstration of KEYRY, a tool for translating keyword queries over structured data sources into queries in the native language of the data source.  ...  This allows it to be used in situations where traditional keyword search techniques over structured data that require such a knowledge cannot be applied, i.e., sources on the hidden web or those behind  ...  Consider for instance the query "movie Avatar actors" over a relational database collecting information about movies.  ... 
doi:10.1007/978-3-642-24574-9_42 fatcat:fa7npu7g5vhhtibfp6xoe5mk34

DivQ

Elena Demidova, Peter Fankhauser, Xuan Zhou, Wolfgang Nejdl
2010 Proceeding of the 33rd international ACM SIGIR conference on Research and development in information retrieval - SIGIR '10  
Keyword queries over structured databases are notoriously ambiguous. No single interpretation of a keyword query can satisfy all users, and multiple interpretations may yield overlapping results.  ...  Firstly, we present a probabilistic model which effectively ranks the possible interpretations of a keyword query over structured data.  ...  Bringing Keywords into Structure In the context of a relational database, a structured query is an expression of relational algebra.  ... 
doi:10.1145/1835449.1835506 dblp:conf/sigir/DemidovaFZN10 fatcat:6b26av45s5fhth4smcuzf727oa
« Previous Showing results 1 — 15 out of 250,374 results