Sciweavers

348 search results - page 50 / 70
» An Efficient Index Lattice for XML Query Evaluation
Sort
View
CIKM
2004
Springer
14 years 1 months ago
Processing content-oriented XPath queries
Document-centric XML collections contain text-rich documents, marked up with XML tags that add lightweight semantics to the text. Querying such collections calls for a hybrid quer...
Börkur Sigurbjörnsson, Jaap Kamps, Maart...
EDBT
1998
ACM
131views Database» more  EDBT 1998»
13 years 12 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
SIGMOD
2002
ACM
114views Database» more  SIGMOD 2002»
14 years 7 months ago
Time-parameterized queries in spatio-temporal databases
Time-parameterized queries (TP queries for short) retrieve (i) the actual result at the time that the query is issued, (ii) the validity period of the result given the current mot...
Yufei Tao, Dimitris Papadias
SIGMOD
2009
ACM
215views Database» more  SIGMOD 2009»
14 years 8 months ago
Efficient type-ahead search on relational data: a TASTIER approach
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
Guoliang Li, Shengyue Ji, Chen Li, Jianhua Feng
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
14 years 18 days ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...