Sciweavers

1890 search results - page 131 / 378
» Querying Big Data by Accessing Small Data
Sort
View
ICDE
2007
IEEE
138views Database» more  ICDE 2007»
16 years 7 months ago
ICEDB: Intermittently-Connected Continuous Query Processing
Current distributed database and stream processing systems assume that the network connecting nodes in the data processor is "always on," and that the absence of a netwo...
Yang Zhang, Bret Hull, Hari Balakrishnan, Samuel M...
WWW
2007
ACM
16 years 7 months ago
Querying and maintaining a compact XML storage
As XML database sizes grow, the amount of space used for storing the data and auxiliary data structures becomes a major factor in query and update performance. This paper presents...
Raymond K. Wong, Franky Lam, William M. Shui
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
16 years 6 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
CIKM
2009
Springer
16 years 1 months ago
Inverted indexes vs. bitmap indexes in decision support systems
Bitmap indexes are widely used in Decision Support Systems (DSSs) to improve query performance. In this paper, we evaluate the use of compressed inverted indexes with adapted quer...
Truls A. Bjørklund, Nils Grimsmo, Johannes ...
SEMWEB
2001
Springer
15 years 11 months ago
An RDF Framework for Resource Discovery
Resource discovery is a problem common to almost all distributed systems. Instead of resulting in a one or a small number of discovery mechanisms, completely different and incompa...
Franklin Reynolds