Sciweavers

709 search results - page 69 / 142
» Efficient Evaluation of All-Nearest-Neighbor Queries
Sort
View
SIGMOD
2006
ACM
232views Database» more  SIGMOD 2006»
16 years 6 months ago
High-performance complex event processing over streams
In this paper, we present the design, implementation, and evaluation of a system that executes complex event queries over real-time streams of RFID readings encoded as events. The...
Eugene Wu 0002, Yanlei Diao, Shariq Rizvi
DKE
2002
107views more  DKE 2002»
15 years 5 months ago
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
Panos Kalnis, Nikos Mamoulis, Dimitris Papadias
PVLDB
2008
134views more  PVLDB 2008»
15 years 5 months ago
Reasoning and identifying relevant matches for XML keyword search
Keyword search is a user-friendly mechanism for retrieving XML data in web and scientific applications. An intuitively compelling but vaguely defined goal is to identify matches t...
Ziyang Liu, Yi Chen
WEBI
2010
Springer
15 years 3 months ago
Using Relational Similarity between Word Pairs for Latent Relational Search on the Web
Latent relational search is a new search paradigm based on the degree of analogy between two word pairs. A latent relational search engine is expected to return the word Paris as a...
Nguyen Tuan Duc, Danushka Bollegala, Mitsuru Ishiz...
DOLAP
2000
ACM
15 years 10 months ago
CUBIST: A New Algorithm For Improving the Performance of Ad-hoc OLAP Queries
Being able to efficiently answer arbitrary OLAP queries that aggregate along any combination of dimensions over numerical and categorical attributes has been a continued, major co...
Lixin Fu, Joachim Hammer