Sciweavers

350 search results - page 17 / 70
» Discovering topical structures of databases
Sort
View
KDD
1997
ACM
114views Data Mining» more  KDD 1997»
15 years 2 months ago
Schema Discovery for Semistructured Data
To formulate a meaningful query on semistructured data, such as on the Web, that matches some of the source’s structure, we need first to discover something about how the infor...
Ke Wang, Huiqing Liu
MOBIDE
2005
ACM
15 years 3 months ago
Tolerance of localization imprecision in efficiently managing mobile sensor databases
Query processing on mobile sensor networks requires efficient indexing and partitioning of the data space to support efficient routing as the network scales up. Building an index ...
Lin Xiao, Aris M. Ouksel
ICDE
2007
IEEE
219views Database» more  ICDE 2007»
15 years 11 months ago
Efficient Keyword Search Across Heterogeneous Relational Databases
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
Mayssam Sayyadian, Hieu LeKhac, AnHai Doan, Luis G...
BMCBI
2007
142views more  BMCBI 2007»
14 years 10 months ago
LinkHub: a Semantic Web system that facilitates cross-database queries and information retrieval in proteomics
nd: A key abstraction in representing proteomics knowledge is the notion of unique identifiers for individual entities (e.g. proteins) and the massive graph of relationships among...
Andrew K. Smith, Kei-Hoi Cheung, Kevin Y. Yip, Mar...
ILP
1998
Springer
15 years 2 months ago
Learning Structurally Indeterminate Clauses
This paper describes a new kind of language bias, S-structural indeterminate clauses, which takes into account the meaning of predicates that play a key role in the complexity of l...
Jean-Daniel Zucker, Jean-Gabriel Ganascia