Sciweavers

709 search results - page 4 / 142
» Efficient Evaluation of All-Nearest-Neighbor Queries
Sort
View
WEBDB
2010
Springer
208views Database» more  WEBDB 2010»
13 years 5 months ago
XML-Based RDF Data Management for Efficient Query Processing
The Semantic Web, which represents a web of knowledge, offers new opportunities to search for knowledge and information. To harvest such search power requires robust and scalable ...
Mo Zhou, Yuqing Wu
WAIM
2010
Springer
13 years 5 months ago
Efficient Continuous Top-k Keyword Search in Relational Databases
Keyword search in relational databases has been widely studied in recent years. Most of the previous studies focus on how to answer an instant keyword query. In this paper, we focu...
Yanwei Xu, Yoshiharu Ishikawa, Jihong Guan
PVLDB
2008
104views more  PVLDB 2008»
13 years 6 months ago
Efficient skyline querying with variable user preferences on nominal attributes
Current skyline evaluation techniques assume a fixed ordering on the attributes. However, dynamic preferences on nominal attributes are more realistic in known applications. In or...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu, Jian Pei, ...
SIGMOD
2005
ACM
168views Database» more  SIGMOD 2005»
14 years 7 months ago
No pane, no gain: efficient evaluation of sliding-window aggregates over data streams
Window queries are proving essential to data-stream processing. In this paper, we present an approach for evaluating sliding-window aggregate queries that reduces both space and c...
Jin Li, David Maier, Kristin Tufte, Vassilis Papad...
PVLDB
2010
121views more  PVLDB 2010»
13 years 2 months ago
Efficient RkNN Retrieval with Arbitrary Non-Metric Similarity Measures
A RkNN query returns all objects whose nearest k neighbors contain the query object. In this paper, we consider RkNN query processing in the case where the distances between attri...
Deepak P, Prasad Deshpande