Sciweavers

1429 search results - page 21 / 286
» Efficient processing of XPath queries using indexes
Sort
View
DAGSTUHL
2006
13 years 9 months ago
Efficient multi-step query processing for EMD-based similarity
Abstract. Similarity search in large multimedia databases requires efficient query processing based on suitable similarity models. Similarity models consist of a feature extraction...
Ira Assent, Thomas Seidl
ADC
2008
Springer
143views Database» more  ADC 2008»
13 years 9 months ago
TRACK : A Novel XML Join Algorithm for Efficient Processing Twig Queries
In order to find all occurrences of a tree/twig pattern in an XML database, a number of holistic twig join algorithms have been proposed. However, most of these algorithms focus o...
Dongyang Li, Chunping Li
ADC
2009
Springer
145views Database» more  ADC 2009»
13 years 11 months ago
Efficient XQuery Join Processing in Publish/Subscribe Systems
Efficient XML filtering has been a fundamental technique in recent Web service and XML publish/subscribe applications. In this paper, we consider the problem of filtering a contin...
Ryan H. Choi, Raymond K. Wong
ICDE
2009
IEEE
183views Database» more  ICDE 2009»
14 years 9 months ago
Efficient Indices Using Graph Partitioning in RDF Triple Stores
With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extr...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
14 years 8 months ago
On MBR Approximation of Histories for Historical Queries: Expectations and Limitations
Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...
Reza Sherkat, Davood Rafiei