Sciweavers

1890 search results - page 19 / 378
» Querying Big Data by Accessing Small Data
Sort
View
IDEAS
1999
IEEE
123views Database» more  IDEAS 1999»
15 years 3 months ago
Improving OLAP Performance by Multidimensional Hierarchical Clustering
Data-warehousing applications cope with enormous data sets in the range of Gigabytes and Terabytes. Queries usually either select a very small set of this data or perform aggregat...
Volker Markl, Frank Ramsak, Rudolf Bayer
MM
2005
ACM
172views Multimedia» more  MM 2005»
15 years 4 months ago
Learning the semantics of multimedia queries and concepts from a small number of examples
In this paper we unify two supposedly distinct tasks in multimedia retrieval. One task involves answering queries with a few examples. The other involves learning models for seman...
Apostol Natsev, Milind R. Naphade, Jelena Tesic
VLDB
2002
ACM
108views Database» more  VLDB 2002»
14 years 10 months ago
Energy-performance trade-offs for spatial access methods on memory-resident data
Abstract. The proliferation of mobile and pervasive computing devices has brought energy constraints into the limelight. Energy-conscious design is important at all levels of syste...
Ning An, Sudhanva Gurumurthi, Anand Sivasubramania...
ICDE
2005
IEEE
101views Database» more  ICDE 2005»
16 years 4 days ago
DUP: Dynamic-tree Based Update Propagation in Peer-to-Peer
In peer-to-peer networks, indices are used to map data to nodes that host the data. The performance of data access can be improved by actively pushing indices to interested nodes....
Liangzhong Yin, Guohong Cao
WISE
2009
Springer
15 years 8 months ago
Web Queries: From a Web of Data to a Semantic Web
ct One significant effort towards combining the virtues of Web search, viz. being accessible to untrained users and able to cope with vastly heterogeneous data, with those of dat...
François Bry, Tim Furche, Klara A. Weiand