Sciweavers

136 search results - page 8 / 28
» Efficient Management of Very Large Ontologies
Sort
View
VLDB
2002
ACM
154views Database» more  VLDB 2002»
13 years 7 months ago
I/O-Conscious Data Preparation for Large-Scale Web Search Engines
Given that commercial search engines cover billions of web pages, efficiently managing the corresponding volumes of disk-resident data needed to answer user queries quickly is a f...
Maxim Lifantsev, Tzi-cker Chiueh
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
14 years 8 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
APWEB
2007
Springer
13 years 11 months ago
DBMSs with Native XML Support: Towards Faster, Richer, and Smarter Data Management
Abstract. XML provides a natural mechanism for representing semistructured and unstructured data. It becomes the basis for encoding a large variety of information, for example, the...
Min Wang
ADHOC
2006
97views more  ADHOC 2006»
13 years 7 months ago
A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks
We study the problem of data propagation in sensor networks, comprised of a large number of very small and low-cost nodes, capable of sensing, communicating and computing. The dis...
Ioannis Chatzigiannakis, Tassos Dimitriou, Sotiris...
SIGMOD
2007
ACM
151views Database» more  SIGMOD 2007»
14 years 7 months ago
The case for a wide-table approach to manage sparse relational data sets
A "sparse" data set typically has hundreds or even thousands of attributes, but most objects have non-null values for only a small number of these attributes. A popular ...
Eric Chu, Jennifer L. Beckmann, Jeffrey F. Naughto...