Sciweavers

2889 search results - page 61 / 578
» Querying Structured Hyperdocuments
Sort
View
ICDE
1998
IEEE
104views Database» more  ICDE 1998»
14 years 9 months ago
Representing and Querying Changes in Semistructured Data
Semistructured data may be irregular and incomplete and does not necessarily conform to a fixed schema. As with structured data, it is often desirable to maintain a history of cha...
Sudarshan S. Chawathe, Serge Abiteboul, Jennifer W...
RECOMB
2009
Springer
14 years 8 months ago
Searching Protein 3-D Structures in Linear Time
Finding similar structures from 3-D structure databases of proteins is becoming more and more important issue in the post-genomic molecular biology. To compare 3-D structures of tw...
Tetsuo Shibuya
SPIRE
2005
Springer
14 years 1 months ago
Rank-Sensitive Data Structures
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost ...
Iwona Bialynicka-Birula, Roberto Grossi
ECIR
2006
Springer
13 years 9 months ago
Efficient Phrase Querying with Common Phrase Index
Abstract. In this paper, we propose a common phrase index as an efficient index structure to support phrase queries in a very large text database. Our structure is an extension of ...
Matthew Chang, Chung Keung Poon
EDBTW
2006
Springer
13 years 11 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