Sciweavers

359 search results - page 70 / 72
» Storing and querying XML data using denormalized relational ...
Sort
View
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 25 days ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
ASWC
2008
Springer
13 years 9 months ago
Scalable Distributed Ontology Reasoning Using DHT-Based Partitioning
Abstract. Ontology reasoning is an indispensable step to fully exploit the implicit semantics of Semantic Web data. The inherent distribution characteristic of the Semantic Web and...
Qiming Fang, Ying Zhao, Guangwen Yang, Weimin Zhen...
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
14 years 1 months ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...
ISCI
2007
115views more  ISCI 2007»
13 years 7 months ago
Compressed histograms with arbitrary bucket layouts for selectivity estimation
Selectivity estimation is an important step of query optimization in a database management system, and multidimensional histogram techniques have proved promising for selectivity ...
Dennis Fuchs, Zhen He, Byung Suk Lee
JAR
2006
236views more  JAR 2006»
13 years 7 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard