Sciweavers

301 search results - page 47 / 61
» Efficient Sketches for the Set Query Problem
Sort
View
WEBI
2010
Springer
14 years 8 months ago
A Scalable Indexing Mechanism for Ontology-Based Information Integration
In recent years, there has been an explosion of publicly available RDF and OWL web pages. Some of these pages are static text files, while others are dynamically generated from la...
Yingjie Li, Abir Qasem, Jeff Heflin
180
Voted
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
15 years 11 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes
EDBT
2006
ACM
182views Database» more  EDBT 2006»
15 years 11 months ago
On High Dimensional Skylines
In many decision-making applications, the skyline query is frequently used to find a set of dominating data points (called skyline points) in a multidimensional dataset. In a high-...
Chee Yong Chan, H. V. Jagadish, Kian-Lee Tan, Anth...
ADC
2008
Springer
100views Database» more  ADC 2008»
15 years 1 months ago
UserMap : an Adaptive Enhancing of User-Driven XML-to-Relational Mapping Strategies
As the XML has become a standard for data representation, it is inevitable to propose and implement techniques for efficient managing of XML data. A natural alternative is to expl...
Irena Mlynkova, Jaroslav Pokorný
COMPGEOM
2007
ACM
15 years 2 months ago
Kinetic KD-trees and longest-side KD-trees
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
Mohammad Ali Abam, Mark de Berg, Bettina Speckmann