Sciweavers

765 search results - page 107 / 153
» Query Processing over Incomplete Autonomous Databases
Sort
View
VLDB
2005
ACM
82views Database» more  VLDB 2005»
15 years 3 months ago
Stack-based Algorithms for Pattern Matching on DAGs
Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes. In this paper, we propose a family of stack-based a...
Li Chen, Amarnath Gupta, M. Erdem Kurul
LREC
2008
112views Education» more  LREC 2008»
14 years 11 months ago
A Ground Truth Dataset for Matching Culturally Diverse Romanized Person Names
This paper describes the development of a ground truth dataset of culturally diverse Romanized names in which approximately 70,000 names are matched against a subset of 700. We ra...
Mark Arehart, Keith J. Miller
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
DLOG
2010
14 years 8 months ago
On the feasibility of Description Logic knowledge bases with rough concepts and vague instances
Abstract. A usage scenario of bio-ontologies is hypothesis testing, such as finding relationships or new subconcepts in the data linked to the ontology. Whilst validating the hypot...
C. Maria Keet
DMSN
2009
ACM
15 years 4 months ago
Validated cost models for sensor network queries
Generating a good execution plan for a declarative query has long been a central problem in data management research. With the rise in interest in wireless sensor networks (WSNs) ...
Christian Y. A. Brenninkmeijer, Ixent Galpin, Alva...