Sciweavers

552 search results - page 76 / 111
» Efficient Algorithms for Processing XPath Queries
Sort
View
EDBT
2006
ACM
174views Database» more  EDBT 2006»
15 years 12 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
SIGMOD
2006
ACM
238views Database» more  SIGMOD 2006»
15 years 12 months ago
Continuous monitoring of top-k queries over sliding windows
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Pa...
ICDE
2010
IEEE
178views Database» more  ICDE 2010»
14 years 9 months ago
The Hybrid-Layer Index: A synergic approach to answering top-k queries in arbitrary subspaces
In this paper, we propose the Hybrid-Layer Index (simply, the HL-index) that is designed to answer top-k queries efficiently when the queries are expressed on any arbitrary subset ...
Jun-Seok Heo, Junghoo Cho, Kyu-Young Whang
SIGMOD
2003
ACM
145views Database» more  SIGMOD 2003»
15 years 12 months ago
Evaluating Probabilistic Queries over Imprecise Data
Many applications employ sensors for monitoring entities such as temperature and wind speed. A centralized database tracks these entities to enable query processing. Due to contin...
Reynold Cheng, Dmitri V. Kalashnikov, Sunil Prabha...
COMAD
2008
15 years 1 months ago
CUM: An Efficient Framework for Mining Concept Units
Web is the most important repository of different kinds of media such as text, sound, video, images etc. Web mining is the process of applying data mining techniques to automatica...
Santhi Thilagam