Sciweavers

2145 search results - page 198 / 429
» Answering Queries Using Views
Sort
View
FOIKS
2004
Springer
15 years 7 months ago
Simplification of Integrity Constraints for Data Integration
When two or more databases are combined into a global one, integrity may be violated even when each database is consistent with its own local integrity constraints. Efficient metho...
Henning Christiansen, Davide Martinenghi
PKDD
2009
Springer
135views Data Mining» more  PKDD 2009»
15 years 10 months ago
Syntactic Structural Kernels for Natural Language Interfaces to Databases
A core problem in data mining is to retrieve data in a easy and human friendly way. Automatically translating natural language questions into SQL queries would allow for the design...
Alessandra Giordani, Alessandro Moschitti
142
Voted
DEXA
2007
Springer
127views Database» more  DEXA 2007»
15 years 10 months ago
A Method for Determining Ontology-Based Semantic Relevance
The semantic web is based on ontologies and metadata that indexes resources using ontologies. This indexing is called annotation. Ontology based information retrieval is an operati...
Tuukka Ruotsalo, Eero Hyvönen
FOIKS
2010
Springer
15 years 11 months ago
Theoretical Foundations for Enabling a Web of Knowledge
The current web is a web of linked pages. Frustrated users search for facts by guessing which keywords or keyword phrases might lead them to pages where they can find facts. Can w...
David W. Embley, Andrew Zitzelberger
PODS
2009
ACM
119views Database» more  PODS 2009»
16 years 4 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi