Sciweavers

3269 search results - page 49 / 654
» Query Optimization for XML
Sort
View
139
Voted
ICDE
2010
IEEE
428views Database» more  ICDE 2010»
16 years 2 months ago
Supporting Top-K Keyword Search in XML Databases
Keyword search is considered to be an effective information discovery method for both structured and semistructured data. In XML keyword search, query semantics is based on the con...
Liang Jeff Chen, Yannis Papakonstantinou
DATESO
2007
103views Database» more  DATESO 2007»
15 years 4 months ago
Using BMH Algorithm to Solve Subset of XPath Queries
Boyer-Moore-Horspool (BMH) algorithm is commonly used to solve text searching problems. In this paper is used to solve the constraint subset of XPath queries offering effective alg...
David Toth
116
Voted
EDBTW
2006
Springer
15 years 6 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
138
Voted
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
16 years 2 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
119
Voted
SIS
2007
15 years 4 months ago
A General Approach to Securely Querying XML
Access control models for XML data can be classified in two major categories: node filtering and query rewriting systems. The first category includes approaches that use access ...
Ernesto Damiani, Majirus Fansi, Alban Gabillon, St...