Sciweavers

2859 search results - page 139 / 572
» Querying Complex Structured Databases
Sort
View
ICEBE
2005
IEEE
168views Business» more  ICEBE 2005»
14 years 1 months ago
Frequency Operators for Condensative Queries over Data Streams
Over a traditional Database Management System (DBMS), the answer to an aggregate query is usually much smaller than the answer to a similar nonaggregate query. Therefore, we call ...
Lisha Ma, Werner Nutt
AP2PC
2003
Springer
14 years 1 months ago
G-Grid: A Class of Scalable and Self-Organizing Data Structures for Multi-dimensional Querying and Content Routing in P2P Networ
Peer-to-Peer (P2P) technologies promise to provide efficient distribution, sharing and management of resources, such as storage, processing, routing and other sundry service capabi...
Aris M. Ouksel, Gianluca Moro
DASFAA
2004
IEEE
169views Database» more  DASFAA 2004»
13 years 12 months ago
Statistic Driven Acceleration of Object-Relational Space-Partitioning Index Structures
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
SPIRE
2005
Springer
14 years 1 months ago
XML Retrieval with a Natural Language Interface
Effective information retrieval in XML documents requires the user to have good knowledge of document structure and of some formal query language. XML query languages like XPath a...
Xavier Tannier, Shlomo Geva
CSR
2007
Springer
14 years 2 months ago
Marrying Words and Trees
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
Rajeev Alur