Sciweavers

709 search results - page 32 / 142
» Efficient Evaluation of All-Nearest-Neighbor Queries
Sort
View
SIGMOD
2007
ACM
124views Database» more  SIGMOD 2007»
16 years 5 months ago
Querying xml with update syntax
This paper investigates a class of transform queries proposed by XQuery Update [6]. A transform query is defined in terms of XML update syntax. When posed on an XML tree T, it ret...
Wenfei Fan, Gao Cong, Philip Bohannon
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
16 years 6 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
PVLDB
2008
144views more  PVLDB 2008»
15 years 5 months ago
Mining search engine query logs via suggestion sampling
Many search engines and other web applications suggest auto-completions as the user types in a query. The suggestions are generated from hidden underlying databases, such as query...
Ziv Bar-Yossef, Maxim Gurevich
ICDE
2006
IEEE
173views Database» more  ICDE 2006»
16 years 7 months ago
Threshold Similarity Queries in Large Time Series Databases
Similarity search in time series data is an active area of research. In this paper, we introduce the novel concept of threshold-similarity queries in time series databases which r...
Alexey Pryakhin, Hans-Peter Kriegel, Johannes A&sz...
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
15 years 7 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...