Sciweavers

1429 search results - page 29 / 286
» Efficient processing of XPath queries using indexes
Sort
View
EDBT
1998
ACM
131views Database» more  EDBT 1998»
13 years 11 months ago
Processing Complex Similarity Queries with Distance-Based Access Methods
Efficient evaluation of similarity queries is one of the basic requirements for advanced multimedia applications. In this paper, we consider the relevant case where complex similar...
Paolo Ciaccia, Marco Patella, Pavel Zezula
WSDM
2010
ACM
259views Data Mining» more  WSDM 2010»
14 years 5 months ago
Revisiting Globally Sorted Indexes for Efficient Document Retrieval
There has been a large amount of research on efficient document retrieval in both IR and web search areas. One important technique to improve retrieval efficiency is early termina...
Fan Zhang, Shuming Shi, Hao Yan, Ji-Rong Wen
ICDE
2003
IEEE
193views Database» more  ICDE 2003»
14 years 9 months ago
An Adaptive and Efficient Dimensionality Reduction Algorithm for High-Dimensional Indexing
The notorious "dimensionality curse" is a well-known phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well known approach to o...
Hui Jin, Beng Chin Ooi, Heng Tao Shen, Cui Yu, Aoy...
WWW
2008
ACM
14 years 8 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
BTW
2005
Springer
108views Database» more  BTW 2005»
14 years 1 months ago
Integrating the Relational Interval Tree into IBM's DB2 Universal Database Server
: User-defined data types such as intervals require specialized access methods to be efficiently searched and queried. As database implementors cannot provide appropriate index str...
Christoph Brochhaus, Jost Enderle, Achim Schlosser...