Sciweavers

6974 search results - page 1218 / 1395
» Querying Semi-Structured Data
Sort
View
SIGMOD
2003
ACM
141views Database» more  SIGMOD 2003»
14 years 10 months ago
QC-Trees: An Efficient Summary Structure for Semantic OLAP
Recently, a technique called quotient cube was proposed as a summary structure for a data cube that preserves its semantics, with applications for online exploration and visualiza...
Laks V. S. Lakshmanan, Jian Pei, Yan Zhao
EDBT
2004
ACM
133views Database» more  EDBT 2004»
14 years 10 months ago
HOPI: An Efficient Connection Index for Complex XML Document Collections
In this paper we present HOPI, a new connection index for XML documents based on the concept of the 2?hop cover of a directed graph introduced by Cohen et al. In contrast to most o...
Ralf Schenkel, Anja Theobald, Gerhard Weikum
ICDE
2010
IEEE
252views Database» more  ICDE 2010»
14 years 10 months ago
Semantic Ranking and Result Visualization for Life Sciences Publications
An ever-increasing amount of data and semantic knowledge in the domain of life sciences is bringing about new data management challenges. In this paper we focus on adding the seman...
Julia Stoyanovich, Kenneth A. Ross, William Mee
WSDM
2010
ACM
210views Data Mining» more  WSDM 2010»
14 years 7 months ago
Leveraging Temporal Dynamics of Document Content in Relevance Ranking
Many web documents are dynamic, with content changing in varying amounts at varying frequencies. However, current document search algorithms have a static view of the document con...
Jonathan L. Elsas, Susan T. Dumais
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
14 years 7 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu
« Prev « First page 1218 / 1395 Last » Next »