Sciweavers

405 search results - page 77 / 81
» Semantic Assumptions and Query Evaluation in Temporal Databa...
Sort
View
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
14 years 2 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...
DBISP2P
2003
Springer
136views Database» more  DBISP2P 2003»
14 years 17 days ago
Building Content-Based Publish/Subscribe Systems with Distributed Hash Tables
Abstract. Building distributed content–based publish/subscribe systems has remained a challenge. Existing solutions typically use a relatively small set of trusted computers as b...
David K. Tam, Reza Azimi, Hans-Arno Jacobsen
DLOG
2006
13 years 8 months ago
On the Scalability of Description Logic Instance Retrieval
Abstract Practical description logic systems play an ever-growing role for knowledge representation and reasoning research even in distributed environments. In particular, the onto...
Ralf Möller, Volker Haarslev, Michael Wessel
SIGMOD
2004
ACM
189views Database» more  SIGMOD 2004»
14 years 7 months ago
A Holistic Paradigm for Large Scale Schema Matching
Schema matching is a critical problem for integrating heterogeneous information sources. Traditionally, the problem of matching multiple schemas has essentially relied on finding ...
Bin He, Kevin Chen-Chuan Chang
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
14 years 7 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi