Sciweavers

707 search results - page 6 / 142
» Processing queries on tree-structured data efficiently
Sort
View
141
Voted
ICDE
2010
IEEE
254views Database» more  ICDE 2010»
16 years 2 months ago
Efficient Rank Based KNN Query Processing Over Uncertain Data
Uncertain data are inherent in many applications such as environmental surveillance and quantitative economics research. As an important problem in many applications, KNN query has...
Ying Zhang, Xuemin Lin, Gaoping ZHU, Wenjie Zhang,...
127
Voted
EDBT
2002
ACM
141views Database» more  EDBT 2002»
16 years 2 months ago
Efficient OLAP Query Processing in Distributed Data Warehouses
Abstract. The success of Internet applications has led to an explosive growth in the demand for bandwidth from ISPs. Managing an IP network requires collecting and analyzing networ...
Michael O. Akinde, Michael H. Böhlen, Theodor...
122
Voted
BTW
2007
Springer
131views Database» more  BTW 2007»
15 years 6 months ago
TopX - Efficient and Versatile Top-k Query Process-ing for Text, Semistructured, and Structured Data
: This paper presents a comprehensive overview of the TopX search engine, an extensive framework for unified indexing and querying large collections of unstructured, semistructured...
Martin Theobald, Ralf Schenkel, Gerhard Weikum
136
Voted
ICDE
2011
IEEE
238views Database» more  ICDE 2011»
14 years 6 months ago
Join queries on uncertain data: Semantics and efficient processing
— Uncertain data is quite common nowadays in a variety of modern database applications. At the same time, the join operation is one of the most important but expensive operations...
Tingjian Ge
247
Voted
VLDB
2008
ACM
206views Database» more  VLDB 2008»
16 years 2 months ago
TopX: efficient and versatile top- k query processing for semistructured data
Recent IR extensions to XML query languages
Martin Theobald, Holger Bast, Debapriyo Majumdar, ...