Sciweavers

2859 search results - page 393 / 572
» Querying Complex Structured Databases
Sort
View
ICNP
2006
IEEE
14 years 2 months ago
DPTree: A Balanced Tree Based Indexing Framework for Peer-to-Peer Systems
— Peer-to-peer (P2P) systems have been widely used for exchange of voluminous information and resources among thousands or even millions of users. Since shared data are normally ...
Mei Li, Wang-Chien Lee, Anand Sivasubramaniam
DMDW
2001
307views Management» more  DMDW 2001»
13 years 9 months ago
An Analysis of Many-to-Many Relationships Between Fact and Dimension Tables in Dimensional Modeling
Star schema, which maintains one-to-many relationships between dimensions and a fact table, is widely accepted as the most viable data representation for dimensional analysis. Rea...
Il-Yeol Song, William Rowen, Carl Medsker, Edward ...
WWW
2010
ACM
14 years 1 months ago
Keyword search over key-value stores
Key-value stores (KVSs) are the most prevalent storage systems for large scale web services. As they do not have the structural complexities of RDBMSs, they are more efficient. In...
Arash Termehchy, Marianne Winslett
FOCS
2009
IEEE
14 years 3 months ago
Orthogonal Range Reporting in Three and Higher Dimensions
In orthogonal range reporting we are to preprocess N points in d-dimensional space so that the points inside a d-dimensional axis-aligned query box can be reported efficiently. T...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
CIMCA
2008
IEEE
13 years 10 months ago
RIAL: Redundancy Reducing Inlining Algorithm to Map XML DTD to Relations
XML has emerged as a common standard for data exchange over the World Wide Web. One way to manage XML data is to use the power of relational databases for storing and q...
Amir Jahangard Rafsanjani, Seyed-Hassan Mirian-Hos...