Sciweavers

2859 search results - page 266 / 572
» Querying Complex Structured Databases
Sort
View
ICDE
2007
IEEE
153views Database» more  ICDE 2007»
16 years 26 days ago
An Indexing Structure for Automatic Schema Matching
Querying semantically related data sources depends on the ability to map between their schemas. Unfortunately, in most cases matching between schema is still largely performed man...
Fabien Duchateau, Zohra Bellahsene, Mark Roantree,...
VLDB
2004
ACM
137views Database» more  VLDB 2004»
15 years 12 months ago
Schema-Free XQuery
The widespread adoption of XML holds out the promise that document structure can be exploited to specify precise database queries. However, the user may have only a limited knowle...
Yunyao Li, Cong Yu, H. V. Jagadish
AAAI
2008
15 years 8 months ago
Existentially Quantified Values for Queries and Updates of Facts in Transaction Logic Programs
In several applications of logic programming and Transaction Logic, such as, planning, trust management and independent Semantic Web Services, an action might produce incomplete f...
Paul Fodor
SIGMOD
2009
ACM
250views Database» more  SIGMOD 2009»
16 years 6 months ago
Query processing techniques for solid state drives
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
Dimitris Tsirogiannis, Stavros Harizopoulos, Mehul...
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 9 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu