Sciweavers

505 search results - page 86 / 101
» Queries with Incomplete Answers over Semistructured Data
Sort
View
EKAW
2010
Springer
14 years 8 months ago
Ontology Engineering with Rough Concepts and Instances
A scenario in ontology development and its use is hypothesis testing, such as finding new subconcepts based on the data linked to the ontology. During such experimentation, knowle...
C. Maria Keet
85
Voted
SBBD
2001
119views Database» more  SBBD 2001»
14 years 11 months ago
The Dimension-Join: A New Index for Data Warehouses
There are several auxiliary pre-computed access structures that allow faster answers by reading less base data. Examples are materialized views, join indexes, B-tree and bitmap in...
Pedro Bizarro, Henrique Madeira
SIGMOD
2007
ACM
229views Database» more  SIGMOD 2007»
15 years 9 months ago
Spark: top-k keyword query in relational databases
With the increasing amount of text data stored in relational databases, there is a demand for RDBMS to support keyword queries over text data. As a search result is often assemble...
Yi Luo, Xuemin Lin, Wei Wang 0011, Xiaofang Zhou
EDBT
2010
ACM
210views Database» more  EDBT 2010»
14 years 11 months ago
Keyword search for data-centric XML collections with long text fields
Users who are unfamiliar with database query languages can search XML data sets using keyword queries. Current approaches for supporting such queries are either for textcentric XM...
Arash Termehchy, Marianne Winslett
CSFW
2011
IEEE
13 years 9 months ago
Dynamic Enforcement of Knowledge-Based Security Policies
—This paper explores the idea of knowledge-based security policies, which are used to decide whether to answer queries over secret data based on an estimation of the querier’s ...
Piotr Mardziel, Stephen Magill, Michael Hicks, Mud...