Sciweavers

591 search results - page 83 / 119
» The complexity of XPath query evaluation
Sort
View
SIGMOD
1998
ACM
143views Database» more  SIGMOD 1998»
14 years 26 days ago
Optimal Multi-Step k-Nearest Neighbor Search
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
Thomas Seidl, Hans-Peter Kriegel
CIKM
2006
Springer
13 years 10 months ago
Efficient range-constrained similarity search on wavelet synopses over multiple streams
Due to the resource limitation in the data stream environment, it has been reported that answering user queries according to the wavelet synopsis of a stream is an essential abili...
Hao-Ping Hung, Ming-Syan Chen
XSYM
2004
Springer
115views Database» more  XSYM 2004»
14 years 2 months ago
XQuery Processing with Relevance Ranking
Abstract. We are presenting a coherent framework for XQuery processing that incorporates IR-style approximate matching and allows the ordering of results by their relevance score. ...
Leonidas Fegaras
SIGMOD
2009
ACM
157views Database» more  SIGMOD 2009»
14 years 8 months ago
Asynchronous view maintenance for VLSD databases
The query models of the recent generation of very large scale distributed (VLSD) shared-nothing data storage systems, including our own PNUTS and others (e.g. BigTable, Dynamo, Ca...
Parag Agrawal, Adam Silberstein, Brian F. Cooper, ...
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
14 years 10 months ago
Adaptive Segmentation for Scientific Databases
In this paper we explore database segmentation in the context of a column-store DBMS targeted at a scientific database. We present a novel hardware- and scheme-oblivious segmentati...
Milena Ivanova, Martin L. Kersten, Niels Nes