Sciweavers

707 search results - page 99 / 142
» Processing queries on tree-structured data efficiently
Sort
View
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
14 years 9 months ago
Algorithms for discovering bucket orders from data
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
Aristides Gionis, Heikki Mannila, Kai Puolamä...
WWW
2004
ACM
14 years 9 months ago
XML data mediator integrated solution for xml roundtrip from xml to relational
This paper presents a system for efficient data transformations between XML and relational databases, called XML Data Mediator (XDM). XDM enables the transformation by externalizi...
Nianjun Zhou, George A. Mihaila, Dikran S. Melikse...
RT
1998
Springer
14 years 27 days ago
Efficient View-Dependent Image-Based Rendering with Projective Texture-Mapping
Abstract. This paper presents how the image-based rendering technique of viewdependent texture-mapping (VDTM) can be efficiently implemented using projective texture mapping, a fea...
Paul E. Debevec, Yizhou Yu, George Borshukov
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 8 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
PVLDB
2008
122views more  PVLDB 2008»
13 years 8 months ago
Exploiting shared correlations in probabilistic databases
There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources -from sensor data, experimental data, data fro...
Prithviraj Sen, Amol Deshpande, Lise Getoor