Sciweavers

1888 search results - page 203 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
ICDE
2009
IEEE
177views Database» more  ICDE 2009»
16 years 5 months ago
Light-Weight, Runtime Verification of Query Sources
Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of a...
Tingjian Ge, Stanley B. Zdonik
AAAI
2008
15 years 5 months ago
Querying Sequential and Concurrent Horn Transaction Logic Programs Using Tabling Techniques
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
Paul Fodor
138
Voted
CIA
2007
Springer
15 years 10 months ago
An Architecture for Hybrid P2P Free-Text Search
Abstract. Recent advances in peer to peer (P2P) search algorithms have presented viable structured and unstructured approaches for full-text search. We posit that these existing ap...
Avi Rosenfeld, Claudia V. Goldman, Gal A. Kaminka,...
ICDE
2008
IEEE
157views Database» more  ICDE 2008»
16 years 5 months ago
TALE: A Tool for Approximate Large Graph Matching
Abstract-- Large graph datasets are common in many emerging database applications, and most notably in large-scale scientific applications. To fully exploit the wealth of informati...
Yuanyuan Tian, Jignesh M. Patel
SAC
2005
ACM
15 years 9 months ago
Indexing continuously changing data with mean-variance tree
: Traditional spatial indexes like R-tree usually assume the database is not updated frequently. In applications like location-based services and sensor networks, this assumption i...
Yuni Xia, Sunil Prabhakar, Shan Lei, Reynold Cheng...