Sciweavers

2859 search results - page 165 / 572
» Querying Complex Structured Databases
Sort
View
DATESO
2004
134views Database» more  DATESO 2004»
13 years 9 months ago
Designing Indexing Structure for Discovering Relationships in RDF Graphs
Discovering the complex relationships between entities is one way of benefitting from the Semantic Web. This paper discusses new approaches to implementing -operators into RDF quer...
Stanislav Barton
EDBTW
2006
Springer
13 years 12 months ago
Hash-Based Structural Join Algorithms
Abstract. Algorithms for processing Structural Joins embody essential building blocks for XML query evaluation. Their design is a difficult task, because they have to satisfy many ...
Christian Mathis, Theo Härder
ICDE
2005
IEEE
146views Database» more  ICDE 2005»
14 years 1 months ago
Best Effort Query Processing in DHT-based P2P Systems
Structured P2P systems in the form of distributed hash tables (DHT) are a promising approach for building massively distributed data management platforms. However, for many applic...
Philipp Rösch, Kai-Uwe Sattler, Christian von...
SIGMOD
2011
ACM
219views Database» more  SIGMOD 2011»
12 years 11 months ago
Context-sensitive ranking for document retrieval
We study the problem of context-sensitive ranking for document retrieval, where a context is defined as a sub-collection of documents, and is specified by queries provided by do...
Liang Jeff Chen, Yannis Papakonstantinou
INEX
2004
Springer
14 years 1 months ago
Narrowed Extended XPath I (NEXI)
INEX has through the years provided two types of queries: Content-Only queries (CO) and Content-And-Structure queries (CAS). The CO language has not changed much, but the CAS lang...
Andrew Trotman, Börkur Sigurbjörnsson