text:
|Publication number
|Publication type
|Application number
|Publication date
|Mar 23, 2010
|Filing date
|Mar 28, 2006
|Priority date
|Mar 28, 2006
|Fee status
|Also published as
|Publication number
|Nicolas Bruno, Surajit Chaudhuri
|Original Assignee
|Microsoft Corporation
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (30), Non-Patent Citations (38), Referenced by (13), Classifications (9), Legal Events (4)
|External Links: USPTO, USPTO Assignment, Espacenet
Databases are very useful tools, and may allow users to organize and selectively retrieve data based on queries, etc. However, as new queries are entered and new sets of indexes and views are generated, a database configuration may typically increase in size over time. A database administrator (DBA) may typically adjust or tune the database configuration to decrease its size. This can be a significant challenge, and often involves using a combination of automated tools and manual adjustment. Current techniques directed to this problem are typically inadequate.
Various embodiments are disclosed relating to databases, and also relating to physical design refinement for a database configuration. According to an example embodiment, an apparatus may be provided that includes a processing device. The processing device may be adapted to obtain a first database configuration, and to make a determination that the size of the first database configuration is greater than a size limit. The processing device may also be adapted to select one of a plurality of database configuration transformations (such as a delete process, a merge process and/or a reduction process), and then to apply the transformation to the first database configuration to produce a second database configuration having a size that is smaller than the first database configuration. In an example embodiment, a database configuration transformation may be selected and applied that has a relatively low (or possibly a lowest) efficiency penalty, as compared to other transformations.
In another example embodiment, a method is provided that includes determining a size limitation for a database configuration, determining a workload of the database configuration, and making a determination that a size of the database configuration is greater than a size limit. The method also may also include applying either a merge process or a reduction process to decrease the size of the database configuration. The merge process may merge a first index/view with a second index view to produce a merged view, for example. The reduction process may delete a first portion of a view to produce a reduced view, where the first (deleted) portion may be recreatable or reproducible from the reduced view.
This summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used as an aid in determining the scope of the claimed subject matter.
Referring to the Figures in which like numerals indicate like elements,
A workload for a database may be the queries which are processed or handled, and the workload may be represented by a common set of queries, for example. In an example embodiment, a workload for a database configuration may be defined based on (or as) a set of queries (e.g., a set of common queries).
As shown in
For database configurations, there may be design tradeoffs between storage space and processing efficiency. There is typically a storage size limitation for a database configuration. For example, at least in some cases, a query may be processed more efficiently on an index (one or more selected columns) since the index may typically be smaller than the base table. However, the index, which duplicates one or more columns from a base table, requires storage space. Also, any changes to the base table will need to be propagated to the one or more indexes. Thus, indexes may include some processing overhead, such as updating data in indexes as data in the base table is updated.
Similarly, a view may also be considered redundant information, providing the resulting data (table subset) from a query. For example, a view may be stored for a common query so that when the query is repeated, the view can simply be retrieved and output without reprocessing the query, thereby increasing processing efficiency for the work or workload. Each view also requires storage space. Therefore, both indexes and views typically provide increased processing efficiency for the database workload, but at the cost of increased storage space. As new queries are run, or new data is input, etc., the database configuration may typically grow to a size that may exceed a size limitation for the database configuration.
Therefore, according to an example embodiment, a database may be refined or tuned through one or more transformations to reduce a size of the database configuration (e.g., by decreasing redundancy in the database configuration), while avoiding a significant loss of processing efficiency. At least some transformations or adjustments to the database configuration may decrease the size of the database and may be associated with an efficiency penalty (e.g., a decrease in processing efficiency). The problem or issue of refining a database configuration (e.g., by reducing redundancy) without substantially compromising processing efficiency may be referred to as the Physical Design Refinement (PDR) problem. A refinement session may be one or more (or a series) of transformations, which may locally change the database configuration by trading space and efficiency. Refinement generally may refer to the process of going from a first database configuration to a second database configuration (e.g., by adjusting or tuning the database configuration by one or more transformations). These transformations may include a merge operation, a reduce (or reduction) operation, and others, for example.
According to an example embodiment, as part of the tuning or refinement of the database configuration, the one or more transformations may be applied to any aspect of the database configuration (indexes, views, etc.). As noted, a database configuration may be generally considered to be a set of indexes and views. The term index/view may be referred to herein to include indexes and/or views (e.g., one or more of indexes, views, indexes over views).
At 220, a determination may be made that the first database configuration is greater than a size limitation for the database. This may be performed, for example, by comparing a size of the database configuration to a size limitation.
At 230, one of a plurality of database configuration transformations is selected. The database configuration transformations may include, for example, a deletion process (or transformation), a merge process and a reduction process, although others may be used as well. A deletion process may, for example, involve deleting a portion of the database configuration (e.g., deleting a view or index if no longer used or not used very often). A merge process (merge transformation) may, for example, involve merging two or more views or two or more indexes (or more generally merging two or more index/views) to create a merged view (e.g., where a redundancy between the two index/views may be decreased or eliminated). The reduction process may involve deleting a portion of a view to create a reduced view, where, for example, the deleted portion may be recreated based on the reduced view. The merge and reduction processes are described in more detail below.
In an example embodiment, selecting (230) one of a plurality of database configuration transformations in refinement process 200 may include: determining an efficiency penalty for one or more of the transformations (232); and selecting a transformation having a lower or lowest efficiency penalty. An efficiency penalty may be determined, for example, by estimating an amount of time to process a query both before and after the transformation. For example, deleting a view, or merging two views, or reducing a view may save storage space at the expense of requiring additional time to process the query. For example, a compensating action may be required to recreate the deleted information to process a query after applying a reduction process to an index/view. The efficiency penalty for such reduction process may be determined or quantified based on the additional time required to perform this compensating action to recreate the deleted information, for example. This is merely an example, and a wide variety of techniques may be used to determine or quantify and compare the various efficiency penalties for each transformation. Alternatively, at 234, in a simple example embodiment, a transformation may be selected, that offers the greatest decrease in size as compared to any decrease in efficiency (e.g., highest ratio of Δ size/Δ efficiency).
At 240, the selected transformation (or process) is applied to the first database configuration to produce a second database configuration that has a smaller size than the first database configuration. The refinement process 200 in
Thus, according to an example embodiment, in a merge process, redundant information between two index/views may be deleted (this information may typically only appear once in the merged view). In this manner, the database configuration may be decreased in size, but at the possible expense of loss of processing efficiency or an efficiency penalty (e.g., additional processing now being required to process certain queries or the workload). For example, a compensating action may now be required to regenerate the first view 300 from the merged view 308. For example, in general, information associated only with the second view 302 may be deleted from the merged view to regenerate the first view 300.
For example, with reference to
At 430, a determination may be made that the database configuration is greater than a size limitation for the database.
At 440, a merge process is applied to the database configuration (e.g., by merging two or more index/views) based on the determination to decrease a size of the database configuration (e.g., if the configuration is too big or exceeds the size limitation). The merge process (440) may include, for example: determining a first index/view (442); determining a second index/view (444); identifying one or more redundancies that exist between the first index/view and the second index/view (446); and eliminating (448) the one or more redundancies between the first index/view and the second index/view to produce a merged index/view (e.g., which would have only one copy of the redundant information between the two views).
Referring to
2.1 A Formal Model
To formalize the view merging problem, three query languages may be considered. Let L1 be the language that defines input views, LM be the language that defines merged views, and LC be the language that defines compensating actions to re-create the original views in terms of merged view.
Definition 1: Given V1 and V2 from L1, we denote VM=V1 ⊕ V2 the merging of V1 and V2 when the following properties hold, in an example embodiment. (Note, the symbol ⊕ is used to denote the merge operator.)
VM belongs to LM.
C1(VM)≡V1 and C2(VM)≡V2 for some C1(VM) and C2(VM) in LC.
If the view matching algorithm matches V1 or V2 for a sub-query q, it also matches VM for q (e.g., a view matching algorithm matches a view V for a sub-query q if q can be answered from V). VM cannot be further restricted with additional predicates and continue to satisfy the previous properties, according to an example embodiment.
View merging and view matching may be related problems. The idea of view merging is, according to an example embodiment, to obtain, for a given pair of views, some sort of minimal view that may be matched for a sub query whenever the original pair of views match. Although both problems are different, some of the technical details that are introduced below are related to those in view matching literature.
As an example, suppose that both L1 and LM are the subset of SQL that only allows simple conjunctions over single tables, and LC is the full SQL (structured query language). Consider the following views: (where a, b, c are indexes—such as age, weight, height, name, etc., within views)
V1=select a,b from R where 10<d<20 (meaning that view V1 is the rows or tuples a and b of a table (or relation) R where the index or element d in such relation R satisfies the indicated range).
V2=select b,c from R where 30<d<40
In this situation, V1 ⊕ V2=select a,b,c from R where 10<d<40. The merged V1⊕V2 is not necessarily smaller than the combined sizes of the input views, as this depends on the number of tuples (or rows) that satisfy 20≦d≦30 (and therefore would be additionally included in V1⊕V2). In contrast, suppose we relax LM to also include disjunctions. In this case, V1⊕V2=select a, b, c, from R where 10<d<20 or 30<d<40. Now, V1⊕V2 contains no additional rows and references only one instance of column b. In general, merged views can be larger than the combined inputs even when there is redundancy, as this depends on the expressive power of LM.
2.2 The LMV Language
In this section, the specific query languages are described, and additional details are provided for the view merging operation. Specifically, if L1 and LM are the subset of SQL that can be used in a database system for materialized view (view) matching, and this language may be denoted as LMV. A view may be given or described by the following expression:
Select S1, S1, . . .
project columns
From T1, T1, . . .
tables in the database
J1 and J2 and . . .
equi-join predicates
R1 and R2 and . . .
range predicates
Z1 and Z2 and . . .
residual predicates
Group by G1, G2, . . .
grouping columns
In other words, we can express in LMV the class of SPJ queries. SPJ is a shorthand for SELECT-PROJECT-JOIN, and it is a subset of the SQL language. SPJ queries with aggregation add group-by clauses to SPJ queries] with aggregation. The reason predicates are split into three disjoint groups (join, range, and residual) is pragmatic. During query optimization, it is easier to perform subsumption tests for view matching if both the view and the candidate sub-query is written in this structured way. A subsumption test checks whether a view is 'more general' than another one. It is similar to an inclusion test, but not completely the same. Specifically, we can then perform simple subsumption tests component by component and fail whenever any of the simple tests fails. For instance, we check that the join predicates in the query are a superset of the join predicates in the view, and the range predicates (column by column) in the query are subsumed by the corresponding ones in the view. Some subsumption tests are more complex than others, notably when group-by clauses are present. We note that this procedure focuses on simplicity and efficiency and therefore can miss some valid matchings due to complex logical rewritings that are not considered by the optimizer. Specifically, consider the case of residual predicates. The problem of determining whether two arbitrary predicates are equivalent can be arbitrarily complex. For that reason, the matching procedure that we consider just checks that every conjunct in the residual predicate of the view appears (syntactically) in the candidate query.
In an example embodiment, a predicate is a test over a tuple, for instance "age<30". A residual predicate is defined above in 45. they are predicates that cannot be classified as range predicates, such as age<30, or equi-join predicates, such as R.a=S.b. A predicate like a*a+b<c is an example of a residual predicate.
Otherwise, although the view can still subsume the query, no match is produced. We simplify the notation of a view in LMV as (S, T, J, R, Z, G), where S is the set of columns in the select clause, T is the set of tables, J, R, and Z are the sets of join, range, and residual predicates respectively, and G is the set of grouping columns. In this example embodiment, the merging operation may be restricted so that the input views agree on the set of tables T, for example. (The sets join, range and residual predicates are the {J1, J2, . . . }, {R1, R2, . . . }, {Z1, Z2, . . . }, respectively, as defined above.) The is twofold. On the one hand, many top-down query optimizers restrict the view matching operation to queries and views that agree on the input tables (presumably, if a candidate view contains fewer tables than the input query q, it should have matched a sub-query of q earlier during optimization). (For example, a query optimizer may be a component in a database system that compiles a SQL query into an efficient execution plan that is later evaluated). On the other hand, merging views with different input tables can be done by combining the reduce (or reduction) operator of and the merging operation. We next define the merging operator in LMV.
Case 1: No Grouping Columns
Consider merging V1=(S1, T, J1, R1, Z1) and V2=(S2, T, J2, R2, Z2). If the merging language were expressive enough, we could define V1⊕V2 as:
Select S1∪S2
From T
Where (J1 and R1 and Z1) or (J2 and R2 and Z2), which satisfies properties 2 and 4 in Definition 1. To satisfy property 1 (rewriting V1⊕V2 in LMV), we may consider the whole predicate in the where clause as a single conjunctive residual predicate Z. The problem is that now the merged view would not be matched whenever V1 or V2 are matched (property 3) because of the simple procedures used during view matching in general and with respect to residual predicates in particular. The smallest view VM may be obtained that is in LMV and satisfies property 3, for example. For that purpose, the above minimal predicate may be rewritten as follows:
Where C is the conjunction of all crossed disjuncts ((J1
According to an example embodiment, the symbols are the logical version of AND (
In an example embodiment, this expression may be relaxed until a predicate is obtained that can be written in LMV and matches any candidate query that is matched by the original views. The expression may be relaxed by first removing the conjunct C, which leaves three conjuncts (J1
We may rewrite: J1
And relax this predicate as follows: we keep (i,j) conjunct for which Ji 1≡Jj 2 and discard (relax) the remaining ones. We obtain then
as the set of join predicates in the merged view. Note that this predicate can be much more general than the original J1
It turns out that the range predicates R1
After obtaining join, range, and residual predicates as described above, the set of columns may be assembled in the merged view. In an example embodiment, at a minimum, this set may typically contain, for example, the union of columns present in both input views. However, in some cases, this is not enough in general, as illustrated next. Consider for instance:
V1=SELECT a FROM R WHERE 10<c<20
V2=SELECT b FROM R WHERE 15<c<30
The candidate merged view V=SELECT a, b FROM R WHERE 10<c<30 does not satisfy property 2 in Definition 1 because V1 and V2 cannot be obtained from V, in this example. The reason is that we need to apply additional predicates to V(c<20 to obtain V1 and 15<c to obtain V2), but V does not expose column c. For that reason, we may add to the set of columns in the merged view all the columns that are used in join, range, and residual predicates that are eliminated in the merged view. Similarly, if some range predicate changed from the input to the merged view, we may need, for example, to add the range column as an output column, or otherwise we may not be able to reconstruct the original views, according to an example embodiment.
To summarize, the merging of two views as described in this section, according to an example embodiment, may be described as follows (this is merely one example, and others may be used):
V1 ⊕ V2 = (S1 U S2 U required columns, T, J1 ∩ J2, R1 ∪ R2, Z1 ∩
In an example embodiment, the symbol ∩ is the intersection operator between sets. For instance {a,b,c}∩{a,d,e}={a}, because a is the element that appears in both sets].
In an example embodiment, all the transformations mentioned above take into account column equivalence. If both input views contain a join predicate R.x=S.y, then the range predicates R.x<10 and S.y<10 are considered to be the same, for example. The following example illustrates some of the ideas described in this section: (the notation R.a refers to a column a within table R; same for table S):
From R, S where
Select y, z
Select x, y, z, a, b, d
R.x = S.y
From R, S where
From R, S where
And 10 < R.b
R.x = S.y
R.x = S.y
And R.x + S.d < 8
And 15 < R.a < 50
And 10 < R.a < 50
And R.b > 5 and R.c > 5
And R.c > 5
And S.y + S.d < 8 and
And R.x + S.d < 8
R.d*R.d = 2
Case 2: Grouping Columns
The case will now be described of merging views that involve group-by clauses. According to an example embodiment, grouping operators partition the input relation into disjoint subsets and return a representative tuple (or row) and some aggregates from each group.
Conceptually, there may be a group-by operator as a post-processing step after the evaluation of the SPJ sub-query. Consider the merged view obtained when the grouping columns are eliminated from the input views. If the group-by columns in the input views are different, each view partitions the input relation in different ways.
In such case, it may be useful to partition the merged view in the coarsest way that still allows us to recreate each input view. For that purpose, the set of group-by columns in the merged view may typically be the union of the group-by columns of the input views. Additionally, each column that is added to the select clause due to predicate relaxation in the input views may typically also be added as a grouping column.
Note that it may be desirable to handle a special case properly. If one of the input views contains no group-by clause, the merged view should typically not contain any group-by clause either, or else we would compromise correctness (i.e., we implicitly define the union of a set of columns and the empty set as the empty set). In these situations, we additionally unfold all original aggregates into base-table columns so that the original aggregates can be computed from the resulting merged view.
To summarize, we define (S1, T, J1, R1, Z1, G1)⊕(S2, T, J2, R2, Z2, G2) as
SM is the set of columns obtained in the no group-by case, plus the group-by columns if they are not the same as the input views. If the resulting GM=�, all aggregates are typically unfolded into base-table columns. Case 1, is the no group-by case. Case 2 is the group-by case.
GM=G1 U G2 U columns added to SM (note that GU�=�).
Example 2: The following example illustrates some of the ideas in this section:
Select R.x, sum (S, y)
Select R.x, R.z
Select S.y, sum (S, z)
From R, S where
From R, S where
From R, S where
R.x = S.y
R.x = S.y
R.x = S.z
And 10 < R.a < 20
And 15 < R.a < 50
And 10 < R.a < 25
Group by R.x
Group by S.y
Select R.x, R.a, S.y, R.z
Select R.x, S.y, R.a, sum(S.y),
From R, S where
R.x = S.y
From R, S where
And 10 < R.a < 50
R.x = S.y
And 10 < R.a < 25
Group by R.a, R.x, S.y
2.3 Indexes on Views
The description above has covered the merging operation applied to materialized views, without paying attention to indexes over those materialized views. In reality, each materialized view may typically be associated with a set of indexes, and those indexes are used during query processing. Previous work in the literature has considered index merging and view merging as separate operations. However, according to an example embodiment, both structures may be described in a unified manner. For this purpose, according to an example embodiment, all indexes may be considered as defined over some view (base tables are also trivial views, so this definition includes regular indexes as well), for example. Specifically, for a sequence of columns I and a view V that contains all I columns in its SELECT clause, we denote I|V as the index with columns I over the materialized view V, for example. For the special case I=�, we define �|V to be the unordered heap containing all the tuples (rows) in V (for simplicity, V and �|V may be used interchangeably).
Unified Merging Operator: We now define the merging of two arbitrary indexes over views. Consider the simplest case of merging two indexes defined over the same view. In this case: (I1|V)⊕(I2|V)=(I1⊕I2)|V, where I1⊕I2 is the traditional index-merge operation. To address the general case, we need to first introduce the notion of index promotion. Consider an index (I|V) and suppose that VM=V⊕V′ for some view V′. Promoting I over V to VM (denoted I↑VM) results in an index over VM that can be used (with some compensating action) whenever (I|V) is used. According to an example embodiment, this promoted index may typically contain all columns in the original index followed by every column that was added to the select clause in VM. For instance, consider:
V1=SELECT x,y FROM R WHERE 10<a<20
V2=SELECT y,z FROM R WHERE 15<a<30
V1⊕V2=SELECT a,x,y,z from R where 10<a<30
We have then that [x]↑(V1⊕V2)=[x,a]. Using index promotion, the merging of two indexes on views may be defined as follows, for example:
That is, according to an example embodiment, the merged index (I1⊕I2) is first obtained, followed by obtaining the view (V1⊕V2), and finally, the merged index is promoted to the merged view.
For example, with reference to
At 650, a reduction process is applied to the database configuration based on the determination (e.g., if the size of the database configuration exceeds the size limit) to decrease the size of the database configuration. The applying a reduction process (650) may include, for example: selecting a first index/view of a plurality of views (652); determining a first portion of the first index/view (654); and deleting the first portion from the first index/view to create or produce a reduced index/view, the first index/view being recreatable or reproducible from the reduced index/view based on a set of rules.
Some additional details and examples will now be described for the reduction operation. In the previous section relating to merge operation, a mechanism was described, for example, to decrease the amount of redundancy between a pair of indexes over views. The idea, for example, may be to merge them into a new index that might be smaller than the combined inputs, but at the same time less efficient to answer queries. In this section we present a second operator that follows the same principle, but operates over a single input index.
Specifically, we may exploit the fact that associated to each index IV there is a supporting primary index or heap that contains all rows and columns of the view V, according to an example embodiment. According to an example embodiment, we use the variable name IV to denote an indexed view, that is an index defined over a view. Therefore, an index over a view can be transformed into another one that is smaller but requires a compensating action involving the corresponding supporting structures. Consider for instance an index I=[a,b,c] over a base table R. We can transform I into I′=[a,b] which is smaller and requires compensating actions to produce the results that I produces by itself (in this case, fetches to R's primary index or heap to retrieve the missing column c), for example. Thus, we can change the definition of an index over a view, possibly reducing its size, and then apply compensating actions to recreate the original structure. We call this operation reduction and denote it with the Greek symbol Rho (ρ). Conceptually, the reduction operation eliminates redundancy just like the merging operation, but it uses a single input structure.
As another way to describe the reduction operation ρ, the reduction operation takes an index IV (e.g., using the LMV as the language for views), a set of tables T′, and a set of columns K′ as inputs, and returns a new index ρ(IV, T′, K′). For a view V=I|(S, T, J, R, Z, G), the operational semantics of ρ((I|V), T′, K′) are given in three steps as follows, according to an example embodiment.
1) If T′
2) We obtain I′ from I by first removing all columns that do not belong to tables in T′, and then adding all columns in S′. (this step is similar to I↑V′)
3) If K
Merging and reduction are powerful primitive operations that may be used to decrease the amount of redundancy in a set of indexes.
4.1 PDR Problem Statement
The physical design refinement (PDR) problem may be described, for example, as follows. Consider a physical database configuration C={I1|V1, . . . , In|Vn} that includes several indexes (I) on views (V) (also recall that base-table indexes may be defined over trivial views). In an example, database configuration C may have been obtained by tuning the database system for a typical workload by either a skilled DBA (database administrator) or an automated tool, for example. The size of a database configuration C may be the combined size of all indexes in C plus the size of heaps (or other data) for indexes on views that do not have a primary index in C, for example. In an example embodiment, a primary index or heap may be provided for each view).
Now, in an example embodiment, after some time the database grows such that the size of the database configuration C (size(C)) becomes larger than the allocated space. It is desirable to obtain a configuration that fits in the storage constraint without compromising the quality of the original configuration C. Instead of considering every possible index for the new configuration, according to an example embodiment, our search may be restricted to those that are either in the initial configuration or can be derived from it via a series of merging and reduction operations. The rationale is that every original execution plan can be in principle adapted with local compensating actions so that it uses the views in the new configuration (or, alternatively, the query can be re-optimized and obtain the new optimal plan).
Workload inference: During refinement, it may be desirable to measure the quality of each candidate configuration that is considered. In an example embodiment, the current configuration may have resulted from a tuning session either by a DBA or an automated tool, for example. It is then expected that many or even all indexes over views in the current configuration may be somehow useful in answering queries in the actual workload, for example.
According to an example embodiment, a hypothetical workload may be inferred with queries that mimic the functionality of each index present in the current configuration. It may be assumed that if a new configuration can efficiently process such hypothetical workload, the benefits of the original indexes would be preserved. Specifically, in an example embodiment, each index IV=I|(S, T, R, J, Z, G) may be associated with a set of queries, called queries(IV), which stress every kind (or at least different kinds) of index usage.
Ordered Scan
Select I from T
Select I From T
Select I From T
where R and J and Z
where R and J and Z
where R and J and Z
Group by G
group by G order by I
[and σ (prefix I)]
group by G [Having σ
(prefix I)]
In absence of additional information, a predefined weight may be assigned to each query (to balance different index usages). However, if the execution of queries is tracked in the system, an accurate measurement of the relative importance of each index usage may be obtained, along with use those relative weights in the refinement process. To define the physical design refinement problem, we first introduce the closure of a configuration under the merging and reduction operations:
Definition 2: Let C be a configuration and let Ci (I≧0) be defined as follows:
C i+1 =C i U{IV 1 ⊕IV 2 for each compatible IV 1 ,IV 2 εC i}
U{ρ(IV,T,K) for each IVεCi and valid choices of T and K}.
where U is the union operator, and ε means "belongs to" and Returns true if an element is a member of a set.
Also, Closure C=Ck, where k is the smallest integer that satisfies Ck=Ck+1.
The operator ⊕ (merge) may refer to merge operation (or merge process), while the operator ρ may refer to reduction operation (or reduction process), according to an example embodiment.
Definition 3 (PDR): Given a configuration C={I1|V1, . . . , In|Vn} and a storage constraint B, obtain the refined configuration C′ such that:
Σ(I|V)εCΣqiεqueriesε(I|V)(wi�cost(qi, C′)) is minimized where wi is the weight associated with query qi, and cost (q, C) is the optimizer estimated cost of query qi under configuration C. In other words, the sum of the weighted costs for the indexes over views is minimized for the new configuration C′.
Some additional properties which may exist:
The benefit of each index (cost) may also be context dependent. e.g., an index not used to answer a query may become useful in conjunction with another index.
4.2 Pruning the Search Space
Some properties will now be described that may be useful in defining heuristics for traversing the search space and approximating PDR. There are two properties described below relating to the merge operator, according to an example embodiment.
Property 1: For a configuration C, IV1 and IV2 be indexes in a closure C, and IVM=IV1⊕IV2. If IVM (merged view) cannot be obtained by merging and reducing views in closure C unless IV1 is in the derivation, the optimal PDR configuration cannot include both IV1 and IVM (analogously IV2 and IVM). Property 1 shows that if we merge two indexes V1 and V2, in some scenarios the optimal solution cannot contain both the merged view and any of the inputs. As shown below, sometimes certain indexes cannot be part of the optimal solution.
Property 2: Let C be a configuration, and let IV1 and IV2 be indexes in a closure C, and if IVM=IV1⊕IV2 belongs to the optimal PDR solution, then either:
i) size(IVM)<size(IV1)⊕size(IV2), or
ii) there are {IV3, . . . IVn}⊂ closure C such that IVm=IVm⊕IV3⊕ . . . ⊕IVn and size(IVm)<Σi size (IVi)
The symbol ⊂ is the inclusion-or-equal operator between sets. It returns true if a set is completely included in (or is equal to) another.
There are analogous properties for reduction operator.
4.3 Heuristic Approach to Approximate PDR
In this section an example heuristic approach is described to solve PDR that is derived from the greedy solution to the fractional knapsack problem, according to an example embodiment. In the fractional knapsack problem, the input objects oi are first sorted in ascending order by the value-volume ratio v(oi)/W(oi) and then remove objects from this sequence until either the remaining objects fill completely the capacity B, or the last removed object ok is the one that exceeds B. In the latter case, we add back a fraction of ok so that the total volume is exactly B. (Alternatively, the objects may be sorted objects in reverse order and keep a prefix of the sequence. This is equivalent to the solution described above, which leads more easily to our adaptation.}. This assignment may be considered optimal if fractions of objects are allowed in the answer. Even in the 0/1 case (i.e., no fractional objects are allowed), this heuristic performs very well in many practical cases and a very simple refinement guarantees a factor-2 approximation to the optimal solution. A straightforward adaptation of the greedy solution described above would first generate the closure of the input configuration C, and then iteratively remove from the current configuration the index with the smallest value-volume ratio until the remaining ones satisfy the storage constraint. This approach may have the following problems:
Properties 1-4 described above may not necessarily be exploited for pruning the search space, in an example embodiment.
To address these issues, a progressive variation of the fractional knapsack solution is described below. Pseudocode for an example embodiment of the progressive variation of the fractional knapsack is illustrated in
We consider the following transformations in line 3: (i) deletion of each index in the current configuration CF, (ii) merging of each pair of compatible indexes in current configuration CF, and (iii) reductions of each index in current configuration CF. (CF is a variable name, e.g., representing the final configuration that is found by PDR). Specifically, for (iii) we consider reductions ρ(IV, T, K) so that K are prefixes of the columns in the resulting index, and T are subsets of tables that match another view in CF.
Properties 2 and 4 may be exploited in line 3 (pseudocode of
Properties 1 and 3 (line 4,
Rather than assigning a constant benefit and weight to ach index, a dynamic approach may be used that considers the interactions with the optimizer. For a given configuration C, a penalty of the transformation (e.g., deletion, merging, reduction) may be defined as Δcost/Δspace, where Δcost is an estimate of the degradation in cost that is expected if the transformation is applied, and Δspace is the amount of space that would likely be saved by applying the transformation. Penalty values are then a measure of units of time that are lost per unit of space that are gained for a given transformation.
To avoid incremental errors in estimation, after each transformation the inferred workload may be re-optimized under the new configuration CF. In an example embodiment, optimization calls may be decreased or minimized by only re-optimizing the queries in the workload that used an index that got removed from current configuration CF. The rationale is that we keep replacing indexes with coarser alternatives, so any query that did not use, for example, IV1 in a given configuration, should not use the merge operation, IV1 ⊕ IV2 or reduction operation, ρ(IV1, T, K) if they became additionally available. This heuristic saves significant time and typically does not substantially degrade the quality of the final configurations, in an example embodiment.
Implementations of the various techniques described herein may be implemented in digital electronic circuitry, or in computer hardware, firmware, software, or in combinations of them. Implementations may be implemented as a computer program product, i.e., a computer program tangibly embodied in an information carrier, e.g., in a machine-readable storage device or in a propagated signal, for execution by, or to control the operation of, data processing apparatus, e.g., a programmable processor, a computer, or multiple computers. A computer program, such as the computer program(s) described above, can be written in any form of programming language, including compiled or interpreted languages, and can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program can be deployed to be executed on one computer or on multiple computers at one site or distributed across multiple sites and interconnected by a communication network.
Method steps may be performed by one or more programmable processors executing a computer program to perform functions by operating on input data and generating output. Method steps also may be performed by, and an apparatus may be implemented as, special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application-specific integrated circuit).
Processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer. Generally, a processor will receive instructions and data from a read-only memory or a random access memory or both. Elements of a computer may include at least one processor for executing instructions and one or more memory devices for storing instructions and data. Generally, a computer also may include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto-optical disks, or optical disks. Information carriers suitable for embodying computer program instructions and data include all forms of non-volatile memory, including by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks. The processor and the memory may be supplemented by, or incorporated in special purpose logic circuitry.
To provide for interaction with a user, implementations may be implemented on a computer having a display device, e.g., a cathode ray tube (CRT) or liquid crystal display (LCD) monitor, for displaying information to the user and a keyboard and a pointing device, e.g., a mouse or a trackball, by which the user can provide input to the computer. Other kinds of devices can be used to provide for interaction with a user as well; for example, feedback provided to the user can be any form of sensory feedback, e.g., visual feedback, auditory feedback, or tactile feedback; and input from the user can be received in any form, including acoustic, speech, or tactile input.
Implementations may be implemented in a computing system that includes a back-end component, e.g., as a data server, or that includes a middleware component, e.g., an application server, or that includes a front-end component, e.g., a client computer having a graphical user interface or a Web browser through which a user can interact with an implementation, or any combination of such back-end, middleware, or front-end components. Components may be interconnected by any form or medium of digital data communication, e.g., a communication network. Examples of communication networks include a local area network (LAN) and a wide area network (WAN), e.g., the Internet.
While certain features of the described implementations have been illustrated as described herein, many modifications, substitutions, changes and equivalents will now occur to those skilled in the art. It is, therefore, to be understood that the appended claims are intended to cover all such modifications and changes as fall within the true spirit of the various embodiments.
|Cited Patent
|Filing date
|Publication date
|Aug 19, 1994
|Jan 16, 1996
|Oracle Corporation
|Physical database design system
|Jun 14, 1993
|Aug 6, 1996
|Hewlett-Packard Company
|Method and apparatus for query optimization in a relational database system having foreign functions
|May 23, 1994
|Aug 13, 1996
|Basil E. Potter & Associates, Inc.
|Encoding method for compressing a tabular database by selecting effective compression routines for each field and structure of partitions of equal sized records
|Dec 1, 1997
|Jun 15, 1999
|Microsoft Corporation
|Database system multi-column index selection for a workload
|Dec 1, 1997
|Jun 15, 1999
|Microsoft Corporation
|Database system index selection using index configuration enumeration for a workload
|Dec 1, 1997
|Jul 20, 1999
|Microsoft Corporation
|Database system index selection using cost evaluation of a workload for multiple candidate index configurations
|Aug 15, 1997
|Sep 7, 1999
|Microsoft Corporation
|Database system index selection using cost evaluation of a workload for multiple candidate index configurations
|Dec 1, 1997
|Sep 28, 1999
|Microsoft Corporation
|Database system index selection using candidate index selection for a workload
|May 30, 1998
|Jan 2, 2001
|Microsoft Corporation
|Index merging for database systems
|Apr 20, 2000
|Jul 24, 2001
|Microsoft Corporation
|Index tuner for given workload
|Aug 1, 2000
|Mar 12, 2002
|Microsoft Corporation
|Merging materialized view pairs for database workload materialized view selection
|Aug 1, 2000
|Mar 12, 2002
|Microsoft Corporation
|Identifying indexes on materialized views for database workload
|Apr 20, 2000
|Apr 2, 2002
|Microsoft Corporation
|Index and materialized view selection for a given workload
|Aug 1, 2000
|Jan 28, 2003
|Microsoft Corporation
|Interesting table-subset selection for database workload materialized view selection
|Mar 15, 1999
|Mar 11, 2003
|Microsoft Corporation
|Sampling for database systems
|Mar 15, 1999
|Apr 1, 2003
|Microsoft Corporation
|Sampling over joins for database systems
|May 18, 2000
|Jul 8, 2003
|Sybase, Inc.
|Database system with methodology for online index rebuild
|Jun 28, 2002
|Nov 21, 2006
|Microsoft Corporation
|Linear programming approach to assigning benefit to database physical design structures
|Jun 28, 2002
|Dec 26, 2006
|Miccrosoft Corporation
|Time-bound database tuning
|Apr 30, 2003
|Jul 24, 2007
|Microsoft Corporation
|Automated layout of relational databases
|Jun 3, 2002
|Oct 9, 2007
|Microsoft Corporation
|Workload analysis tool for relational databases
|Jun 29, 2004
|Jun 3, 2008
|Microsoft Corporation
|Ranking database query results using probabilistic models from information retrieval
|Jun 23, 2003
|Dec 30, 2008
|Microsoft Corporation
|Integrating horizontal partitioning into physical database design
|Aug 10, 2004
|Jan 27, 2009
|Microsoft Corporation
|Dynamic physical database design
|Sep 10, 2002
|Jul 28, 2009
|Microsoft Corporation
|Sampling for database systems
|Aug 13, 2004
|Jul 28, 2009
|Microsoft Corporation
|Generating a labeled hierarchy of mutually disjoint categories from a set of query results
|Jun 21, 2002
|Dec 25, 2003
|Curl Corporation
|Views for software atomization
|Aug 26, 2003
|Jun 17, 2004
|Vincent Civetta
|Database sizing and diagnostic utility
|Oct 15, 2004
|Apr 20, 2006
|Microsoft Corporation
|Database tuning advisor
|May 7, 2004
|Dec 1, 2004
|Microsoft Corporation
|System and method for resizing a database
|"TPC Benchmark H", Standard Specification, (1993-2005) Transaction Processing Performance Council, 115 pages.
|Agrawal et al, "Automated Selection of Materialized Views and Indexes for SQL Databases", 2000.
|Agrawal et al., "Automatic Physical Design Tuning: Workload as a Sequence", in Proceedings of the ACM International Conference on Management of Data (SIGMOD) (2006).
|Agrawal, et al. "Database Tuning Advisor for Microsoft SQL Server 2005", pp. 1110-1121, (2004).
|Agrawal, et al. "Database Tuning Advisor for Microsoft SQL Server 2005", pp. 1110-1121.
|Agrawal, et al. "Materialized View and Index Selection Tool for Microsoft SQL Server 2000", 1 page, (2001).
|Agrawal, et al. "Materialized View and Index Selection Tool for Microsoft SQL Server 2000", 1 page.
|Bruno et al., "An Online Approach to Physical Design Tuning", in Proceedings of the International Conference on Data Engineering (ICDE) (2007).
|Bruno et al., "Physical design refinement: The "Merge-Reduce" Approach", in Proceedings of the International Conference on Extending Database Technology (EDBT) (2006), ACM Transactions on Database Systems (TODS) (2007).
|Bruno et al., "To tune or not to Tune? A Lightweight Physical Design Alerter", in Proceedings of the International Conference on Very Large Databases (VLDB'06) (2006).
|Bruno, et al. "Automatic Physical Database Tuning: A Relaxation-based Approach", pp. 227-238, (2005).
|Bruno, et al. "Automatic Physical Database Tuning: A Relaxation-based Approach", pp. 227-238.
|Chaitin et al., "Register Allocation Via Coloring", in Computer Languages, vol. 6, pp. 47-57 (1981).
|Chaudhuri et al, "Rethinking Database System Architecture: Towards a Self-tuning RISC-style Database System", 2000, VLDB Journal.
|Chaudhuri et al., "Compressing SQL Workloads" in Proceedings of the ACM International Conference on Management of Data (SIGMOD) (2002).
|Chaudhuri, et al. "An Efficient, Cost-Driven Index Selection Tool for Microsoft SQL Server", Redmond, WA. pp. 1-10, (1997).
|Chaudhuri, et al. "An Efficient, Cost-Driven Index Selection Tool for Microsoft SQL Server", Redmond, WA. pp. 1-10.
|Chaudhuri, et al. "Index Merging", Microsoft Research, Redmond, WA. 8 pages, (1999).
|Chaudhuri, et al. "Index Merging", Microsoft Research, Redmond, WA. 8 pages.
|Dageville, et al. "Automatic SQL Tuning in Oracle 10g", Redwood Shores, CA. pp. 1098-1109, (2004).
|Dageville, et al. "Automatic SQL Tuning in Oracle 10g", Redwood Shores, CA. pp. 1098-1109.
|Finkelstein, S., "Common Expression Analysis in Database Applications", in Proceedings of the ACM International Conference on Management of Data (SIGMOD) (1982).
|Goldstein, et al. "Optimizing Queries Using Materialized Views: A Pracctical, Scalable Solution", Redmond, WA. pp. 331-342, (2001).
|Goldstein, et al. "Optimizing Queries Using Materialized Views: A Pracctical, Scalable Solution", Redmond, WA. pp. 331-342.
|Graefe, G., "The Cascades Framework for Query Optimization", Data Eng. Bull. 18, 3 (1995).
|Kim et al, "View-Size Estimation in Self-Organizing Databases", 2005.
|Konig et al., "Scalable Exploration of Physical Database Design", in Proceedings of the International Conference on Data Engineering (ICDE) (2006).
|Mistry et al., "Materialized View Selection and Maintenance Using Multi-Query Optimization", in Proceedings of the ACM International Conference on Management of Data (SIGMOD) (2001).
|Park et al., "Using Common Subexpressions to Optimize Multiple Queries", in Proceedings of the International Conference on Data Engineering (ICDE) (1988).
|Ross et al., "Materialized View Maintenance and Integrity Constraint Checking: Trading Space for Time", in Proceedings of the ACM International Conference on Management of Data (SIGMOD) (1996).
|Roy et al., "Efficient and Extensible Algorithms for Multi Query Optimization", in Proceedings of the ACM International Conference on Management of Data (SIGMOD) (2000).
|Sattler et al, "QUIET: Continuous Query-driven Index Tuning", 2003.
|Selinger et al., "Access Path Selection in a Relational Database Management System", in Proceedings of the ACM International Conference on Management of Data (1979).
|Sellis, T. K., "Multiple-Query Optimization", ACM Trans. Database Syst. 13, 1, 23-52 (1988).
|Valentin, et al. "DB2 Advisor: An Optimizer Smart Enough to Recommend Its Own Indexes", IEEE (2000), pp. 101-110.
|Weikum et al, "Foundations of Automated Database Tuning", Mar. 27, 2006.
|Zilio et al., "Recommending Materialized Views and Indexes with IBM DB2 Design Advisor", in International Conference on Autonomic Computing (2004).
|Zilio, et al. "DB2 Design Advisor: Integrated Automatic Physical Database Design", Proceedings of the 30th VLDB Conference (2004), Toronto, Canada, pp. 1087-1097.
|Citing Patent
|Filing date
|Publication date
|Apr 10, 2006
|Feb 8, 2011
|Oracle International Corporation
|Mechanism for improving performance on XML over XML data using path subsetting
|Jun 26, 2008
|Jun 21, 2011
|Microsoft Corporation
|Configuration-parametric query optimization
|May 18, 2004
|Jul 24, 2012
|Oracle International Corporation
|Storing XML documents efficiently in an RDBMS
|Jul 13, 2010
|Aug 7, 2012
|Microsoft Corporation
|Hierarchical merging for optimized index
|May 25, 2006
|Aug 13, 2013
|Oracle International Coporation
|Isolation for applications working on shared XML data
|Jul 29, 2013
|Jan 6, 2015
|Oracle International Corporation
|Isolation for applications working on shared XML data
|Aug 20, 2013
|Jan 31, 2017
|Google Inc.
|Unified searchable storage for resource-constrained and other devices
|May 18, 2004
|Mar 10, 2005
|Krishnamurthy Sanjay M.
|Storing XML documents efficiently in an RDBMS
|Apr 10, 2006
|Aug 17, 2006
|Asha Tarachandani
|Mechanism for improving performance on XML over XML data using path subsetting
|Apr 19, 2006
|Oct 25, 2007
|Ravi Murthy
|Mechanism for abridged indexes over XML document collections
|May 25, 2006
|Nov 29, 2007
|Asha Tarachandani
|Isolation for applications working on shared XML data
|Jun 26, 2008
|Dec 31, 2009
|Microsoft Corporation
|Configuration-parametric query optimization
|Aug 20, 2013
|Jul 17, 2014
|Google Inc.
|Unified searchable storage for resource-constrained and other devices
|U.S. Classification
|1/1, 707/999.101
|International Classification
|Cooperative Classification
|European Classification
|Dec 8, 2006
Owner name: MICROSOFT CORPORATION, WASHINGTON
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BRUNO, NICOLAS;CHAUDHURI, SURAJIT;REEL/FRAME:018599/0548
Effective date: 20061129
Owner name: MICROSOFT CORPORATION,WASHINGTON
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BRUNO, NICOLAS;CHAUDHURI, SURAJIT;REEL/FRAME:018599/0548
Effective date: 20061129
|Feb 1, 2011
|Certificate of correction
|Aug 26, 2013
|Fee payment
Year of fee payment: 4
|Dec 9, 2014
Owner name: MICROSOFT TECHNOLOGY LICENSING, LLC, WASHINGTON
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:MICROSOFT CORPORATION;REEL/FRAME:034542/0001
Effective date: 20141014


text:
Cheese pierogi
42,630pages onAdd New Page
this wiki
this wiki
Cheese pierogi was a Human food consisting of dumplings made with unleavened dough and cheese, with some type of filling. It was Zefram Cochrane's favorite food.
In 2378, when Naomi Wildman and Neelix planned the 315th anniversary of First Contact Day aboard USS Voyager, Neelix made the cheese pierogi himself instead of replicating them. The Doctor, unaware of this, complained they had absolutely no nutritional value and suggested that Neelix ought to have included a vitamin supplement when he replicated them. (VOY: "Homestead")

subset: commoncrawl


text:
The Internet is a great place to do business, whether you're a retailer selling a particular line of products or a service provider making your living on the Internet. There is, however, one age-old problem with business that never seems to go away: people won't buy what they don't know about.
Home Internet Marketing Business ABCs
Almost everyone nowadays wants to have his very own profitable home internet marketing business that can ease his financial burdens and help him sail smoothly through the ravages of the global financial crisis currently engulfing the economies of the world. Understanding of the ABCs or fundamentals of internet marketing is essential to the success of any online home business.
Premier Internet Marketing Education – 10 Tips on How to Find the Best Internet Education
Where do you go to get the internet marketing education that will truly make the difference? The difference in your understanding, or (if you're building a business) the difference in how you approach the marketing of your business, or perhaps your job (if you're responsible for directing the marketing tactics for a brand)?
» Read more: Premier Internet Marketing Education – 10 Tips on How to Find the Best Internet Education


text:
Deadline: 31 May 2017 Are you driven by a meaningful vision ? Are you brimming with bright ideas ? Do you want to make a real difference, perhaps with a business that benefits the community, or a project in the cultural sector, or with a technology that addresses a specific problem in your home country. What are you waiting for? Let's turn your ideas into action. The DO School of Innovation is seeking applications for its Entrepreneurship for good program that is a one year funded … [Read more...]
EU Call for Proposals: Apply for ERC Advanced Grants 2017
Deadline: 31 August 2017 The European Commission is currently seeking proposals for European Research Council (ERC) Advanced Grants designed to support excellent Principal Investigators at the career stage at which they are already established research leaders with a recognised track record of research achievements. Applicant Principal Investigators must demonstrate the ground breaking nature, ambition and feasibility of their scientific proposal. This action is open to researchers of any … [Read more...]
National Geographic Society: Seeking Applications for Standard Grant Program
Deadline: 1 July 2017 The National Geographic Society is seeking applications for its Standard Grant Program to award grants for research, conservation, education, and storytelling through its Committee for Research and Exploration. National Geographic Society grant-funded projects should be bold, innovative, and transformative. The National Geographic Society is a nonprofit scientific and educational organization dedicated to exploring our planet, protecting wildlife and habitats, and … [Read more...]
European Union: Call for Proposals to Modernize the Education System in Azerbaijan
Deadline: 14 July 2017 The European Union (EU) is currently accepting proposals from eligible organisations for a programme entitled "Modernizing the Education System in Azerbaijan through the involvement of civil society and the introduction of inclusive education" with an aim to strengthen civic participation, governance and inclusiveness of the education system. Lots & Objectives Lot 1: Inclusive Education To review and optimise the policy for and management of an inclusive … [Read more...]
NordForsk Call for Projects: The Underpinnings of Nordic Societal Security
Deadline: 20 September 2017 The NordForsk, together with the Academy of Finland, Norwegian Directorate for Civil Protection (DSB), Research Council of Norway, Swedish Civil Contingencies (MSB) and Icelandic Centre for Research (RANNIS) has issued a call entitled "The Underpinnings of Nordic Societal Security" under the Nordic Societal Security Programme. The Nordic Societal Security Programme is a multidisciplinary research programme that aims to generate new knowledge about what is required … [Read more...]
WISIONS Call for Applications: Sustainable Energy Project Support (SEPS) Knowledge Exchange Program 2017
Deadline: 23 June 2017 WISIONS is currently inviting applicants for its Sustainable Energy Project Support (SEPS) Knowledge Exchange program 2017 with an aim to mobilize knowledge and expertise among energy practitioners and other stakeholders in the field of sustainable energy technologies in the "Global South", with a focus on decentralised energy solutions. This call for proposals is aimed at both focus regions of WISIONS – Latin America and the Caribbean, and South/South East Asia. The … [Read more...]
New Plastics Economy Innovation Prize: Apply for Circular Materials Challenge!
Deadline: 20 October 2017 As part of the New Plastics Economy Innovation Prize, the Ellen MacArthur Foundation is asking the question how can we make all plastic packaging recyclable? The Circular Materials Challenge is currently inviting innovators to find alternative materials that could be recycled or industrially composted. The aim of the Challenge is to stimulate the development of materials that could be captured and recycled or composted effectively rather than being incinerated or … [Read more...]
UNOV/UNODC Call for Proposals: Drug Abuse Prevention Centre (DAPC) Grants 2017
Deadline: 9 June 2017 The United Nations Office on Drugs and Crime is seeking proposals for its Drug Abuse Prevention Centre (DAPC) Grants 2017 in order to provide funding support to not-for-profit organisations working in low- and middle-income countries whose projects are aimed at preventing substance use among the youth. The objective of this Grants programme is to strengthen the capacity of civil society to prevent drug abuse globally. Thematic Areas Are focused on prevention of … [Read more...]
Knight-Hennessy Scholars Program: Preparing Leaders to Address Global Challenges in the 21st Century and Beyond
Deadline: 27 September 2017 The Stanford University is accepting applications for its Knight-Hennessy Scholars program that is designed to build a multidisciplinary community of Stanford graduate students dedicated to finding creative solutions to the world's greatest challenges. Program Structure Leadership Development: Building on departmental programs, scholars will learn to communicate, collaborate, and innovate with their fellow Knight-Hennessy Scholars from other disciplines. … [Read more...]
#youforG20 – Project for an Interconnected World: Apply & Win upto 15,000 euros!
Deadline: 2 July 2017 On the occasion of the G20 Summit, Deutschland is seeking applications for its world-wide competition "#youforG20 – your project for an interconnected world". The G20 summit in Hamburg in July will revolve around the big issues facing global society. The competition #youforG20 is looking for good ideas with which each and every one of us can make a difference for the environment, the climate, and society. Benefits The best project wins 15,000 euros. Eligibility … [Read more...]
2017 AGFUND International Prize: Inviting Non-Governmental Organizations and Individuals Worldwide
Deadline: 30 September 2017 The Arab Gulf Programme for Development (AGFUND) invites the United Nations, international and regional organizations, ministries and public institutions, national Non-governmental organizations and individuals worldwide to submit nominations as deemed eligible for the 2017 AGFUND International Prize for Pioneering Human Development Projects. The Subject of the 2017 AGFUND Prize is "Ensure inclusive and quality education and promote lifelong learning for … [Read more...]
European Union: Recovery of Affected Marine Ecosystems and Development of Marine and Coastal Biodiversity in Lebanon
Deadline: 5 July 2017 The European Union (EU) is currently accepting proposals from eligible organisations for a program entitled "Recovery of affected marine ecosystems and development of marine and coastal biodiversity" to enhance the protection and sustainable development of maritime resources in Lebanon. Size of Grants Any grant requested under this call for proposals must fall between EUR 250,000 and EUR 300,000. Location Actions must take place in Lebanon. Duration The initial … [Read more...]
Call for Applications: Fourth International "Kazakhstan through the Eyes of Foreign Media" Contest
Deadline: 25 June 2017 Kazakhstan's Ministry of Foreign Affairs is pleased to announce the call for applications to the 2017 "Kazakhstan through the Eyes of Foreign Media" Competition, seeking to reward original articles about Kazakhstan that have been published in a foreign (non-Kazakhstani) media outlet. This contest aims to recognize and reward the authors of the best and most objective journalistic reports, stories and analytical pieces about Kazakhstan, which are published in foreign … [Read more...]


text:
The John George Jr. Student Loan Fund
Helping the worthy men and women of Jackson since 1940
The John George, Jr. Student Loan Fund has been assisting Jackson area students in continuing their education for over seven decades. Established by its namesake, John George Jr., the fund was based on the philosophy that no one should be denied the intellectual and cultural advantages that come with higher education. His student loan fund was intended to inspire and support the youth of his home community; Jackson, Michigan.
Unlike federal student aid, the John George is a private loan. The interest rate, however, is less than half the rate that is typically associated with federal loans. Eligible students may borrow up to $6,000 per year at a 2% interest rate. Over four years, the student may borrow up to a total of $24,000. The CCAC strongly encourages all Jackson County students to apply for the John George Student Loan.
Eligibility Requirements
In order to be eligible for the John GeorgeJr. Student Loan, students must meet the following eligibility guidelines:
Applications are available between October 1 and May 1 and may be downloaded from the web site or by visiting the John George Student Loan office at 145 S. Jackson Street, Jackson, Michigan at the corner of South Jackson and Cortland streets.
*Applications received after May 1 will be considered on a funds-available basiis.


text:
If you're like me and LOVE Piko (AKA the sofest/stretchiest/best staple ever) shirts, look no farther than a new best friend/website I found for purchasing these tried and true basics that are so comfortable you'll want to sleep in them...and yes, I might have done that before, so no judgment please. Look HERE to stock up on your favorite colors and various styles and for only $20, you can get all the colors you need to fill up the closet. My favorite is the Long Sleeve Top and I already have them in grey, black, red, and dark grey. (FYI, for sizing, I wear a small)
I wanted to purchase this lovely Ikea table for a local shopping event I have coming up for Sugar Bit (details on that next week), but of course I couldn't order it online, nor would the closest store (Atlanta) hold it for me long enough to drive down there and get it. That's when I looked to ModerNash, which is a local business who drives to Ikea each week, makes custom orders for people, and then brings them back. Then, they call you to let you know it's in their warehouse, you pick it up, and then you can go about your merry way. Genius, right?? They do charge a minimal markup, but to save me the hassle of driving to ATL and making my way through the overwhelmingly huge Ikea store, that fee was well worth it. Big win in my book AND they have popular items already in stock. No, I was not paid to say this...this is my honest opinion from a very happy customer.
You only use a total of 4 ingredients, so this is something ANYONE can make. Even better, the ingredients come already packaged, so hello EASY PEASY! I'm making these tonight and tomorrow so I hope friends and family love them as much as I do...Sausage Crescent Bites. YUMMY!
I've told you before I get lazy when fall rolls around...lazy in the working out department, but not so lazy when it comes to eating and baking. That's why I have started this Everyday Wake-up Workout. This is something I can tackle as soon as my feet hit the ground and before two little munchkins start screaming for some attention. Even better, I don't need any weights/mats/machinery to get this knocked off my to-do list. It may not be much, but anything is better than nothing!
FIVE. Wallpaper Love
I think I'm becoming addicted to wallpaper...and it makes me laugh thinking about all that heinous wallpaper I saw everywhere growing up and saying "I will never have wallpaper"...adulthood strikes again my dears! I already have it in our powder room downstairs and a few have already been pinned for future reference because I can't get enough. And P.S. if you don't like it, that's fine, too.


text:
We build all over N. California!
Please note where you plan to build in the comments below.
We look forward to serving you and treating you right!
Chico Model Home & Design Center
ENERGY STAR® builder
Open Mon-Sat
13468 State Highway 99 N
Chico, CA 95973
Want ENERGY STAR® features?
Want a faster-built home?
Want the look of site-built?
Get the look and features of site-built, in about 1/2 the time and 1/2 the budget with Cousin Gary Homes!
Contact us today and your own, personal Building & Design Consultant will help you build an ENERGY STAR® qualified home to YOUR specifications, from the low 50's!
We'll treat ya right!
- ENERGY STAR® Leadership in Housing Award
- Skyline Customer Satisfaction Award
- Skyline #1 Volume Dealer Award
- CMHI Retailer of the Year Award
- 3-Year complete home warranty included as standard on all new homes
- Turn-Key project management
- Customizable floor plans
- Personal Building & Design Consultants
- Fully-Furnished model homes
- Experienced builder since 1972
Ask us how you can FLIP your old mobile into a brand new Cousin Gary Home for little or no money down! 1-877-409-7033
Cousin Gary Homes
Open Mon-Sat
Serving families from the Sutter Buttes to Red Bluff!
Copyright © 2003-2010, Opportune Online Marketing, Inc. All Rights Reserved.
Terms of Service/Privacy


text:
While Germany suffers its worst recession for 20 years, city experts believe the determination of British consumers to keep spending will reinforce the UK's position as one of the strongest western economies.
Shrugging off the 11 September atrocities, consumers are expected to spend more than 1.5 per cent above last year's figure even though 41 per cent of those interviewed for Deloitte & Touche's annual Christmas survey said they felt gloomy about the economy.
More than three-quarters (77 per cent) of retailers expect sales to increase even though 47 per cent believe the economy is getting worse.
Richard Lloyd-Owen, head of consumer business at Deloitte & Touche, which commissioned the NOP Consumer survey of 1,000 adults and 600 retailers, said: "Consumer spending has been propping up the economy and retailers have had a good year with sales growth up eight per cent on the previous year. While December growth will be much more modest, Christmas will still make up the majority of some retailers' annual sales. Consumers are just more likely to be sensible rather than over-indulgent."
- More about:
- Cities
- Consumer Issues
- Deloitte And Touche
- Financial Crisis


text:
Chapter 1.3
So this became the daily routine for the next few days. A slam, a fainted man and another day back in bed. It was tiresome, but Elizabeth was curious. What was so important about the sea that the man was so drawn to it?
Today though, the slam never came. Elizabeth waited for it. But it never came. She got up from her seat near the window and creeped into the room. There the man sat gazing sadly at the sea.
"You didn't leave." She finally said, breaking to silence. The old man only nodded. "Why do you want to leave so bad?"
He was silent for a while, thinking, before he responded.
"Have you travelled the seas before?"
Elizabeth shook her head.
"Well, you sure are missing out on a lot then."
And that was all he said. Elizabeth left the room puzzled. Someone who traveled the seas? What was he? A pirate? She shook her head and left.
The next morning, she heard a shout. Elizabeth scrambled up and opened the door of the room, the man wasn't there. Surprised, she looked around frantically, eventually, coming to the conclusion that he finally left. She pushed open the door and to her surprise, saw a large wooden ship docked on land.
What was an 18th century ship doing here? She walked up to inspect it. It smelled deeply of the sea and the wood was still wet. Across the bow, "The Rosy Dirk" was painted carefully in large script letters. While she felt the strong urge of imminent danger on that ship, she was curious. Curiosity killed the cat. But satisfaction revived.


text:
Already a member? Login
500 g
In stock
Product ID: S02037
Expiration: September 2017
View all Sisu products
Retail : $34.99
Vitasave: $26.99
(Save 22%)
Share and Get $10:
Protein is essential to the development and maintenance of every cell in the body. Even though protein-deficient diets are rare in North America, a high-quality protein supplement can be beneficial for athletes and active individuals, growing teens, seniors, and people watching their weight. Athletes want a source of protein that is metabolized into muscle tissue. People who want to lose weight need protein that provides a steady, long-lasting supply of energy, suppresses appetite and food cravings, and slows the blood sugar highs and lows caused by some carbohydrates. Whey Protein Isolate can help older people limit muscle loss over time and support bone density. It is also an excellent low-fat and low-carbohydrate source of additional body-building protein and an energy booster for growing teenagers.
Directions: Mix 2 scoops (30 grams) in 1 cup (250 ml) of milk, soy milk or water or add desired quantity to juice, blender drink, yogurt, cereal, muffin or pancake mix.
30 Capsules
$49.49 (Save 25%)
828 g
$39.99 (Save 27%)
120 vegicaps
$54.99 (Save 11%)
180 capsules
$49.99 (Save 17%)
837 g
50 tablets
$7.99 (Save 11%)
876 g
$49.99 (Save 29%)
12 Bars
$32.99 (Save 31%)
180 vegicaps
$49.00 (Save 20%)
12 Day Kit
$36.60 (Save 25%)
You have no items in your shopping cart.


text:
Mobile App
Gwalior College of Education
Madhya Pradesh
Total Students
Fees Range
How to reach
Gwalior College of Education is situated at Gwalior Road, Bhind - 474 001 (M.P.) in Bhind.
Courses Offered
- 1 Years
- B.Ed.
- Languages / Arts / Literature
- 2 Years
- Diploma
- Languages / Arts / Literature
Gwalior College of Education - GCE
Patiram Shivhare Lok Kalyan evam Shiksha Nyas which made an impressive entry in to the field of Teachers education in the year 2002. In the year of 2006 be started working in different areas of the society, mainly concerned in education & upliftment of the masses, with this principle in mind we were started a nursing College in Bhind (M.P.) being a charitable trust accepts service to the sufferers with entire Zeal & Abroad .Since then it has registered trailblazing track record of success. With a 100% continuous success rate in almost all its courses and With a 100% placement for students after completion of the courses, the college today attracts students from all over India like Kerala,Tamil Nadu, Andhra Pradesh, Rajasthan, Himachal &U.P etc. Today we live in an era when the world is opening its eyes to India. Even as India is fast emerging as a new economic superpower, Indian professionals are scaling the commanding heights of the global economy. High intellectual ability combined with strong academic background and capacity for hard work has made Indians the most sought after workforce all over the world. Patiram Shivhare Group of Institutions provides highly innovative skill oriented university affiliated courses which empower the new generation to get the right career break in these fields. The institutions not only provide students with quality education, but also groom them to face life with confidence. Excellence in education is the driving principle at PSGI. No effort is spared in providing students with a focused academic environment which nurtures complete development of personality.
Why join Gwalior College of Education Bhind
The college has excellent state of the art infrastructure facilities
2 Type Courses Available
- 1 UG Courses
- 1 Diploma Courses
Gwalior College of Education Placements
Gwalior College of Education (GCE) provides placement assistance to all its students. The dedicated placement cell regularly conducts grooming sessions of the students in areas like soft skills, interview facing skills, behavioral skills hereby making them industry-fit. In the recent years the college has witnessed some well known recruitment companies walking-in and being invited for campus placements.
Visiting Companies
Student Placement
At Gwalior College of Education the students are endowed with all convenient amenities that make their life 'go easy' in college hours, alongside make learning more interesting. Some of the facilities include well ventilated classrooms, recreational areas, hostel facility for boys and girls, indoor and outdoor games, stocked library, seamless internet/wifi connectivity, medical facilities etc.
Try our extensive database of FAQs or submit your own question...
what is the average placement in JLJ Academy Harsh Vvvv Asked this 1 year, 11 months ago - India
Query Utsav mukherjee Asked this 1 year ago - India
BA eng hon. Anonymous User Asked this 12 months ago - India


text:
Pedestrian struck by car dies in La Quinta
Accident happened on Fred Waring Drive and Palm Royale Drive
La Quinta - A pedestrian was struck and killed by a vehicle in La Quinta Tuesday afternoon. The collision was reported shortly after 1:20 p.m. at Fred Waring and Palm Royale drives, according to the Riverside County Fire Department.
Sheriff's Deputy Armando Munoz said the driver stayed at the scene and was cooperating with authorities. He said alcohol, drugs and the motorist's speed weren't factors in the crash.
The identity of the victim, a man in his early 50s, was being withheld until his next-of-kin could be notified. Fred Waring between Palm Royale and Washington Street was closed in both directions for the investigation, and westbound Fred Waring was closed from Palm Royale to Adams Street, Munoz said. The roadway was re-opened just before 4:00 p.m.


text:
Scott Huddleston
San Antonio Express-News
January 19, 2013
Trevor Denn mused on the value of community as he brushed sky-blue paint on the Rev. Martin Luther King Jr.'s words displayed on a banner: "The time is always right to do the right thing.â€
"I think service is really important. It bonds us together,†said Denn, a senior studying international relations at St. Mary's University and one of about 350 participants Saturday in a local MLK Day of Service.
To prepare for Monday's march on the East Side honoring the slain civil rights leader, volunteers painted posters, touched up murals, picked up trash, planted trees and planted landscaping along the 2.75-mile route.
The work was part of a DreamWeek San Antonio celebration from Jan. 11-22, and a National Day of Service declared by President Barack Obama on the weekend prior to his inauguration.
Along with more than 100 local members of City Year, an international, education-focused nonprofit that promotes leadership and service, the event drew about 250 volunteers.
"Our mission today is to celebrate Dr. King's legacy through community service,†said Susan Varghese, a City Year corps member and media chairwoman of the MLK Service Project Committee.
Aside from sprucing up the area for the march, which is one of the largest events of its kind in the nation, Varghese said the annual day of labor also helps build relationships and neighborhood pride.
"We do projects year-round, and some of them involve work that's tedious. This is more fun.â€
Working with the city's Parks and Recreation Department, Green Spaces Alliance of South Texas and business sponsors, City Year tries to develop the next generation of leaders by giving young people a forum to focus their energy on the common good of the community, Varghese said.
More than 250,000 were expected to have gathered at similar service events nationwide, in what Obama has said hopefully will become an annual MLK tradition.
In Washington, a fair was held on the National Mall to raise awareness about service organizations, as volunteers worked to fill some 100,000 relief kits for deployed U.S. troops, veterans and emergency first responders.
Yviand Serbones, who helped repaint a mural that an anticipated 100,000-plus marchers will pass Monday, said she "was living in a bubble†while growing up on the North Side.
Her 10 months of service nearly a decade ago with City Year, providing tutoring for children at an inner-city elementary school, "opened my eyes.â€
It was heartbreaking, Serbones said, to learn that some children rely on school lunch for "their main meal of the day†as their parents struggled financially, often working two jobs. When she was accepted to the University of Texas, she wore a Longhorns shirt to the school and told the children that they could go to college as well.
"It really made me feel committed to San Antonio as a whole. I don't want to be that close-minded again,†said Serbones, now 28 and working in public relations.
Denn said he's hopeful Americans can work together after a contentious election year.
"We're not really going to get everything done unless we put all that aside,†Denn said. "We need to come together.â€


text:
OSOYOOS, B.C. – The Tumbleweed Film Festival is bringing the best-rated films from its Oroville film fest to Osoyoos, BC, Sept 22-24.
Tumbleweed 'Best of Fest' Film Festival starts Thursday in Osoyoos
Tonasket approves CDBG contract for sewer project
TONASKET – The Tonasket City Council approved a CDBG grant to cover the city's match for the $1.256 million project extending the sewer to Mill Drive area near Bonaparte Creek.
Firefighters fighting wildlandfire spanning both sides of border
NIGHTHAWK – A small fire spanning the U.S.-Canadian Border was still burning in scattered pine and brush in the hills near the Nighthawk/Chopaka Port of Entry.
The fire, which is believed to have started on Sunday, Sept. 18 had grown to 593 acres on the American side of the border and 50 to 100 acres on the Canadian side, according to Guy Gifford, a fire information spokesman with the Department of Natural Resources (DNR).
Tumbleweed Film Festival rolls north across the border
OSOYOOS, B.C. – The Tumbleweed Film Festival is bringing the best rated films (and other new films) from its Oroville film fest to Osoyoos, BC, Sept 22-24.
Economic Alliance plans NCW Economic Summit Sept. 23
OMAK – "Leading the Way Towards Economic Recovery" is the theme of the NCW Economic Summit planned for Friday, Sept. 23 at the Omak Performing Arts Center.
Suspect in Brewster man's murder captured in California
FRESNO, Calif. – U.S. Marshals and Fresno Police arrested Nicolas Perez-Patistan, a suspect in the beating death and robbery of a Brewster man back in July.
Perez-Patistan, 25, Brewster, was arrested on a warrant for murder in the second degree. Perez was a fugitive who had fled Okanogan County and was wanted on an outstanding nationwide felony arrest warrant for second degree murder, according to Okanogan County Sheriff Frank Rogers.
"Perez is believed to be involved in the beating and subsequent death of Carlos Porras-Trujillo which occurred on July 17, 2011 near Brewster. Carlos Porras-Trujillo was beaten over the head numerous times with a club and his body was dumped in an orchard. It also appeared that Porras-Trujillo had been robbed," said Sheriff Rogers.
City has public hearing on Oroville Reman and Reload expansion
OROVILLE – The Oroville City Council held a public hearing to discuss a conditional use permit regarding the expansion of Oroville Reman and Reload's lumber mill operations at the council's Tuesday, Sept. 6 meeting.
Ecology approves treatment of milfoil by Weed Board in Lake Osoyoos
OROVILLE – The state has approved a plan by the Okanogan County Noxious Weed Board to treat Eurasian Watermilfoil in Lake Osoyoos, although in a greatly reduced area then the board previously requested.
Campfire restrictions on DNR campgrounds in Okanogan County
OLYMPIA- On Sept. 2 the Washington State Department of Natural Resources increased thefire danger rating from "moderate" to "high" in Ferry and Stevens countiesoutside of Fire Districts 1 and 2 and also put restrictions on severalcampgrounds in Okanogan County.
Oroville Library's Country Celebration this Saturday
OROVILLE – The ninth annual Country Celebration, sponsored by the Oroville Community Library Board as a fundraiser for the building fund, will take place at the Oroville Grange Hall this Saturday, Sept. 10 at 6 p.m.


text:
Documentation Architecture Specific Content Beat
From FedoraProject
(Difference between revisions)
Immanetize (Talk | contribs)
|Line 2:
|Line 2:
{{Docs beat open}}
{{Docs beat open}}
[[Category:Docs Project]]
[[Category:Docs Project]]
[[Category:Draft documentation]]
[[Category:Draft documentation]]
[[Category:Documentation beats]]
[[Category:Documentation beats]]
Revision as of 02:01, 25 October 2012
3D Desktops for POWER
Fedora 18 for Power now adds support for LLVMpipe. This enables IBM Power Systems on Fedora to use the 3D Software Render fallback and run Gnome3 and all other 3D applications on IBM Power Systems like on Intel platforms on systems that lack hardware 3D support. Full functionality is also available through VNC sessions.


text:
The DGP's meeting with the Chief Minister assumed significance as the former had refused to brief Achuthanandan on the case during the election campaign as he had said it would involve violation of the Model Code of Conduct.
According to sources, Punnoose had a 20-minute meeting with the Chief Minister today after getting permission from the Election Commission.
"I have apprised the Chief Minister of the details. And (have) nothing more to add," Punnoose told mediapersons after the meeting.
The ice cream parlour case had created a political storm in 2005, with the name of IUML leader and the then Industries Minister P K Kunhalikutty figuring in it.
Kunhalikutty, however, was never listed as an accused in the case. The case relates to a sensational sex scandal in Kozhikode that surfaced in late 1990s, using an ice cream parlour as a cover to lure young girls into a sex racket.
Recently, the scandal was in the news again with a relative of Kunhalikutty claiming that he had helped the IUML leader to scuttle the probe into the case by influencing victims and witnesses to retract their statements. The fresh probe into the case was ordered based on the new allegations.
The Chief Minister had earlier directed the DGP and ADGP Vinson M Paul heading the investigation team that he should be apprised of the progress of the probe regularly. He also wanted the investigators to be in touch with legal experts suggested by him for effective conduct of the probe.
However, police had expressed difficulty to go by the directive since the election campaign was on at that time.


text:
A lot of times when I'm in the parks, I want a quiet meal. It's less about the food than just sitting down someplace where I don't have to compete to get a table and where someone brings me my food. Bonus points if it's a litle quieter than Cosmic Rays. The Plaza Restaurant fits that bill completely.
Located in the Magic Kingdom, the Plaza serves reliably good sandwiches and provides a nice break from the hustle and bustle of the Magic Kingdom. Afterwards, you can also satisfy your sweet tooth with ice cream specialties and cheesecake. The decor continues the theme you'll see all along Main Street USA: Imagine an early 20th Century ice cream parlor, complete with windows decked out in sheer white curtains, white moulding, brass accents, and green chairs. The room is pretty without being fussy and the staff is friendly and attentive, as is the case in most Disney restaurants.
The reuben sandwich is a favorite, with corned beef stacked high. If you're a New Yorker, you might want to pass, but the rest of us will enjoy this spicy sandwich served with crispy fries.
Vegetarians aren't left out. In fact, if you forgo eating meat, the Plaza is a much better alternative than the veggie burgers and sandwiches you'll find at quick-service locations in the parks. At $10.99, this sandwich costs just slightly more than a quick-service meal and comes with mozzarella, hummus, pesto, cucumber, roasted red pepper, tomato, and lettuce on a freshly baked foccaccia You also get a choice of broccoli slaw, chips, or fries.
I really enjoyed the cheeseburger here. I'm sure it's the same patty you get elsewhere in the Magic Kingdom, but it was fresher and the bun tasted better. I'd go back just for it. The fries that come with all these sandwiches are larger and crispier than those served at quick-service locations. You can also get thick-cut chips. Both are a nice choice, but I'm going to give an edge to the fries.
The Plaza is the type of restaurant where, if you stick with simple dishes, you'll leave happy, but venture into the more complicated territory of pastas and (gasp) meatloaf and you'll probably be disappointed. Since entrees here cost only a bit more than your average quick-service meal, I recommend not using a table-service credit, especially if you're not getting dessert. Instead, just pay out of pocket. Reservations are not difficult to get, but if you'd like to eat at peak times, make sure to make your reservations as far out as possible.


text: SAN JOSE, Calif., March 27, 2012 /PRNewswire/ -- Echelon Corporation (NASDAQ: ELON), a global leader in energy control networking for the smart grid, smart city and smart building applications, and Holley Metering Limited, a leading smart metering vendor in China, today announced an agreement under which the two companies will form a new joint venture company in China, Zhejiang Echelon-Holley Technology Co., Ltd. ("Echelon-Holley"), to focus on the development and sales of advanced smart metering products for China. Echelon-Holley is committed to act in the best interests of the two companies' respective customers and agents. The new company will be headquartered in Hangzhou, China, and will develop advanced smart metering and related solutions that deliver performance, reliability and expanded functionality to China's developing smart grid. The partnership will leverage Echelon's Silicon Valley energy control networking innovation center and its 20 years of experience in highly reliable power line control and communications hardware and software platforms for smart grid applications, and Holley Metering's breadth of metering solutions, low cost manufacturing competencies and extensive customer relationships. The joint venture is majority owned by Echelon. Echelon and Holley Metering will both contribute cash and resources into the new company. This transaction represents a unique relationship between leading Chinese and U.S. companies in the smart grid industry. Echelon and Holley Metering can leverage their respective strengths through this cooperation. The partnership will create significant value, not only for the two companies involved, but also for the customers, distributors, OEMs and other agents throughout China. This transaction is a highly constructive development in the industry. "We are delighted to broaden our partnership with Holley Metering to serve the larger smart grid market in China. With a mandate to connect 300 million homes and businesses to the smart grid over the next five years, Chinese utilities will need to leverage the best the world has to offer," said Ron Sege, chairman and CEO of Echelon. "Our new joint venture is positioned to bring the most innovative solutions in the world to bear on China's need to deliver and use energy more efficiently by leveraging both Silicon Valley and China-based ingenuity. We are also excited about the possibility of achieving Echelon and Holley Metering's broader vision for the joint venture's future in developing smart meter products for markets outside China." "We are extremely excited to utilize Echelon's field-proven technologies and leverage their extensive experience gained by connecting more than 35 million homes and 300,000 buildings to the smart grid," said Jin Meixing, chairman of Holley Metering. "By bringing the best technology in the world into China and incorporating it into products that meet this market's unique needs, we can grow our business and satisfy a critical, unmet need." The Echelon-Holley joint venture is expected to be operational in Q3 2012.


text:
TRENTON Ś Some people consider the bug a delicacy for consumption.
But a Trenton Central High School teacher allegedly used two dead cockroaches as punishment.
Ninth-grade student Kameera McLeroy told The Trentonian that she was eating a snack after gym class Tuesday morning while the teacher for her next class was running 10 minutes late. When her teacher arrived she sat at her desk and continued to eat her donuts.
ôShe put the cockroaches on my desk because I was eating,ö the 15-year-old said. ôI was just about getting done and she snatched the donuts out of my hand and said, ĹThis is what happens when you eat and leave crumbs on the floor.ĺö
McLeroy claims the teacher thought she left crumbs on the floor, when in reality the remnants on the floor were from a crumbled wall.
In addition to the two cockroaches caught in a glue trap, McLeroy said the teacher left water, napkins and hand sanitizer on her desk, which was captured in a picture she took.
ôI pushed the desk away because I didnĺt want to be too close to them,ö the student said of the critters. ôIt was there for a good 45 minutes. I didnĺt have any other choice because all of the other desks were full.ö
After reaching her breaking point, the student asked the teacher to take the cockroaches off her desk or she was going to tell her mom.
ôShe was like ĹAll you had to do was just ask me,ĺö McLeroy said, adding the teacher then quickly removed the CSI insect scene.
After learning of the incident, McLeroyĺs mother Monica Hersey signed her daughter out of school and met with Vice Principal Dana Williamson at 1:30 p.m.
ôHe said he was going to have a meeting with the teacher today,ö Hersey said. ôIĺm kind of confused the type of people that they have coming into the school to teach our children.ö
When approached for comment at 3 p.m. at the Chambers Street school, Williamson said the incident is under investigation.
ôI havenĺt spoken to the teacher at this time,ö he said.
The vice principal declined further comment.
Hersey said her daughter has never been suspended nor gotten into any trouble at the school.
ôThis is so rude,ö the mother said outraged. ôThey never apologized and Iĺm appalled by that.ö
Due to the bug incident, Hersey said she will not send the daughter back to TCHS for her sophomore year.
ôThat high school sucks,ö she said.


text:
$ 24.00 $ 29.99 Not Available
- Condition:
- New
- Item No.
- 223846
- Mfg Part No.
Product Information for Zoom 4322 USB Bluetooth Adapter
Highlights for Zoom 4322 USB Bluetooth Adapter
- Host Interface:USB
- Wireless Transmission Speed:3 Mbps
Marketing Information
The Zoom Model 4322 Zoom Bluetooth Adapter plugs into a personal computer to provide a wireless connection to another Bluetooth-enabled device, such as an audio system receiver, modem, mobile phone, headset, computer, PDA, mouse, keyboard, or peripheral. The Model 4322 is a Class 2 Bluetooth device, which provides a range of up to 10 meters.
Technical Information
Additional Product Specifications
General Information
Additional Information
- Communicates with Class 1, 2, and 3 Bluetooth devices
- Integrated internal antenna
Package Contents
- 4322 USB Bluetooth Adapter
- USB Cable
- Manual
Operating Systems Supported:
- Windows Vista, XP, 2000
- Macintosh OS 10.3 or higher
Green CompliantYes
Green Compliance Certificate/AuthorityRoHS
Physical Characteristics


text:
Vegan Carob Chips
Retail Price:
Our Price: $4.95 (Save 20%)
In the summer, we carefully ship this item with an eco-friendly ice pack and insulation to keep it fresh in transit. This is reflected in an additional charge of $2.95/order.
We are not shipping to the following states: Florida, New Mexico, Oklahoma, Texas.
Why You'll Love It
About This Brand
Malted corn and barley, palm kernel oil, carob powder, soy lecithin.
California residents: Learn more on Prop 65 warning. Disclaimer: Information, statements, and reviews regarding products have not been evaluated by the Food and Drug Administration. Results vary person to person, and there is no guarantee of specific results. Thrive Market assumes no liability for inaccuracies or misstatements about products.
Amount Per Serving
Reviews For Vegan Carob Chips
Based on 13 Reviews
So crunchy and delicious in baked goods and defiantly ends my sweet tooth without the caffeine of chocolate. Love melting it over strawberries too!
- Ayla Canaran
Good substitute for chocolate
I can't eat chocolate, and these chops have been a good substitute for me. I can't find them anywhere local, so I order from Thrive. Be sure to stock up during cold months because they charge extra shipping for some extra packaging to keep them from melting in warm months. I melt them in milk to make hot "cocoa", use them in cookies, and eat them with walnuts as a snack. They don't re-solidify like chocolate in baked goods, but taste similar to chocolate. Close enough for someone who was a total chocoholic but hasn't had been able to eat chocolate for years now.
- Kelly
Must have Pantry Item
I'm allergic to cocoa. Yes, it's sad. But carob has made a good substitute for me. I've tried other carob chips, but I like these best. They don't have GMO products and are vegan. Not too sweet. Good texture. Little nuggets of goodness that I use sparingly as a treat sprinkled on my mid-afternoon snack of apple slices and nut butter or tucked into my spelt and banana muffins. I recommend these chips!
- Christy
Only Ok
Bought these as a chocolate substitute for trail mixes. I haven't had carob in years because it's hard to find in my area, but these chips don't taste like other carob I've had. The grain taste is more evident in these. I don't usually bake with chocolate but I may try that and see if I get better results.
- Jill
Great chocolate alternative and both of my toddlers love to gobble them up! Very versatile; sprinkled on oatmeal or in muffins.
- Lisa
Love these!
I've used these for years, they're a really tasty vegan treat and I use them many different ways. Thrive has the lowest price I've ever seen!
- Carol
vegan carob chips
like product and price. not an abundant supply in store in my area. so I like that I can get an amount to meet my needs. order process not complicated.
- Lamont
Surprising taste and very delicious! Love it!
- Jennifer
Love these! So yummy!
I have to stop myself from eating these straight out of the bag... They are so good! I made some vegan spelt carob chip cookies on Valentine's Day and they baked perfectly and we're absolutely delicious! The carob chips have a bit of a raisin bran taste to me. I will definitely have to order more bags next time, I love to bake and it makes it even better that I can make it vegan!
- Hanifah Nurtaj
Great chocolate chip alternative
I like to use these carob chips to replace chocolate chips. If I'm going to cook vegan and gluten free, I decided I should go all in-including in that area. These chips are amazing! They hold up to heat really well and taste very good.
- NinaNina03
Chocolate Covered Everything
I use these vegan carob chips for everything! They are so sweet and delicious. I like to make my own Carob covered cherries and peanut butter bulls eyes. So good!
- B._Williams
Just awesome !!!
I always enjoyed it (for baking or just for desert), now even more since it's cheaper with Thrive !
I'm just too impatient for Thrive Market new location cause shipping it's so long from California to NY.
- Blandine
I absolutely LOVE these! I use them to make carob covered almonds, carob chip cookies, carob covered rice krispie treats, carob bars, s'mores and anything else you would use "chocolate chips" for. I put them in the freezer overnight to make carob chip cookies, it helps to prevent them from getting too hot and popping open while baking. I also keep the dough in the fridge while a batch is in the oven baking. Can't say enough about how great these are and buying them online here is MUCH cheaper than in stores :)
- Jen
Featured on Thrive Market
There's a reason why words like indulgent and rich often describe chocolate—eating it is quite an experience. And it's not as bad for you as you might believe.Read More
The sweet tooth can often be the biggest barrier to eating healthy.Read More
When I learned I couldn't have gluten or dairy anymore, I kissed my Huckleberry Bakery days good bye and immediately jumped into baking gluten- and dairy-free.Read More