Not signed in (Sign In)

Not signed in

Want to take part in these discussions? Sign in if you have an account, or apply for one below

  • Sign in using OpenID

Site Tag Cloud

2-category 2-category-theory abelian-categories adjoint algebra algebraic algebraic-geometry algebraic-topology analysis analytic-geometry arithmetic arithmetic-geometry book bundles calculus categorical categories category category-theory chern-weil-theory cohesion cohesive-homotopy-type-theory cohomology colimits combinatorics complex complex-geometry computable-mathematics computer-science constructive cosmology deformation-theory descent diagrams differential differential-cohomology differential-equations differential-geometry digraphs duality elliptic-cohomology enriched fibration foundation foundations functional-analysis functor gauge-theory gebra geometric-quantization geometry graph graphs gravity grothendieck group group-theory harmonic-analysis higher higher-algebra higher-category-theory higher-differential-geometry higher-geometry higher-lie-theory higher-topos-theory homological homological-algebra homotopy homotopy-theory homotopy-type-theory index-theory integration integration-theory k-theory lie-theory limits linear linear-algebra locale localization logic mathematics measure-theory modal modal-logic model model-category-theory monad monads monoidal monoidal-category-theory morphism motives motivic-cohomology nforum nlab noncommutative noncommutative-geometry number-theory of operads operator operator-algebra order-theory pages pasting philosophy physics pro-object probability probability-theory quantization quantum quantum-field quantum-field-theory quantum-mechanics quantum-physics quantum-theory question representation representation-theory riemannian-geometry scheme schemes set set-theory sheaf sheaves simplicial space spin-geometry stable-homotopy-theory stack string string-theory superalgebra supergeometry svg symplectic-geometry synthetic-differential-geometry terminology theory topology topos topos-theory tqft type type-theory universal variational-calculus

Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.

Welcome to nForum
If you want to take part in these discussions either sign in now (if you have an account), apply for one now (if you don't).
    • CommentRowNumber1.
    • CommentAuthorAndrew Stacey
    • CommentTimeJul 25th 2011

    I’m considering disabling atom_with_content for the main nLab. It would be very easy to replace this with an ATOM feed generated daily from the database. This could, potentially, take the place of “Recently Revised” as well. The only thing that we would lose by doing this, as far as I can see, is the instantaneous nature of these pages. Rather, they would switch to being updated once a day.

    However, I may have missed something, or people might use these pages in ways that I haven’t anticipated, so please let me know what you think before I enact these changes.

    • CommentRowNumber2.
    • CommentAuthorUrs
    • CommentTimeJul 25th 2011
    • (edited Jul 25th 2011)

    Hm, could this also be the reason for the frustrating experience that I am having, that the nnLab tends to hang especially when I start working on it? Because, let’s see, is this saying that some processes related to atom feeds tend to start eating up resources as soon as new entries are being created?

    • CommentRowNumber3.
    • CommentAuthorAndrew Stacey
    • CommentTimeJul 25th 2011

    I think so, because every time a new page is created or edited, the atom feed goes out of date and needs to be regenerated.

    • CommentRowNumber4.
    • CommentAuthorUrs
    • CommentTimeJul 25th 2011

    Okay, good that you have identified this!

    I am strongly in favor of you “enacting these changes”, then.

    • CommentRowNumber5.
    • CommentAuthorEric
    • CommentTimeJul 25th 2011

    I used to like having fairly instantaneous feeds, but certainly could live without it.

    I wonder if there is much difference if you updated the feed once per day or 12 times per day? How heavy of a load is it to update the feed? I definitely don’t think the feed has to be updated with every single edit, but every 2 hours would be nice if not too much trouble.

    • CommentRowNumber6.
    • CommentAuthorTobyBartels
    • CommentTimeJul 25th 2011

    I have sometimes used the instantaneous report on Recently Revised, but not the ATOM feed, so I have no objection to disabling it.

    If disabling Recently Revised would improve performance, then I can live with that too.

    • CommentRowNumber7.
    • CommentAuthorDavidRoberts
    • CommentTimeJul 26th 2011

    Certainly, a two-hourly update shouldn’t be two much of a disruption, if anyone needs to use Recently Revised as a feed, rather than a daily digest.

    • CommentRowNumber8.
    • CommentAuthorAndrew Stacey
    • CommentTimeJul 26th 2011

    For the moment, I’ve redirected the nlab’s atom_with_content feed to the atom_with_headlines version. Please let me know if this breaks anything.

    • CommentRowNumber9.
    • CommentAuthorzskoda
    • CommentTimeJul 26th 2011

    I never used atomfeed whatever it is and always use Recently Revised to check for recent changes (unfortunately the ouput goes to far in past, what is good for perosnal labs where few changes happen but bad with too long lots on the main lab – maybe two versions should exist, RECENTLY revised, pages and the list of all pages with last revision indicated chronologically (what seems to be now). I use this for including watching for spam, looking for my recent edits when reporting latest changes (I often do not report latest changes and then at the day make one compact entry – say within Zoran’s new entries – on the main changes in the day) and remembering the names of entries where I for somebody else) put some material recently in last few days, that I remember the material but not the page name, and sometimes just for curiosity what my colleagues think about these days.

    Sorry for being uneducated but I do not understand if the software needs to check the very database for the changes in last day or so. This would look unreasonable. Why not just do it with messaging: that whenever an entry is changed a message gets generated and recorded to a daily list and if the entry exists on the list for that day, then removing the old message for the same entry from the list. The list of current changes is far shorter and easier to manipulate than the main database. This would require just a message in the change of page process and one update per message and no looking into the central database at all.

    • CommentRowNumber10.
    • CommentAuthorUrs
    • CommentTimeJul 26th 2011

    Sorry for being uneducated but I do not understand if the software needs to check the very database for the changes in last day or so. This would look unreasonable. Why not just do it with messaging: that whenever an entry is changed a message gets generated and recorded to a daily list

    Maybe we had touched on this before, in previous discussion: my impression is that this is generally the reason for the fact that the instiki software does not scale and that we find outselves turning off all its features: at its core, it is apparently not programmed with wikis of more than a handful of pages in mind.

    • CommentRowNumber11.
    • CommentAuthorUrs
    • CommentTimeJul 26th 2011
    • (edited Jul 26th 2011)

    … which is maybe not too surprising: if one looks around on the web, one sees that instiki is being advertized as being easy to install . That’s apparently its main selling point. No wonder that we are running into trouble with it, I think.

    I have mentioned the following before, but received no replies: I’d be willing to pay a professional programmer (or team, or whatever it takes) to seriously look into the instiki code for all the problems that we are having. Currently all we are doing is iteratively switching off features of the software. That is better than it breaking all down, but in the long run is rather paradoxical.

    But I don’t know how to go about hiring some programmer to do this. Does anyone think it would make sense? Does anyone have experience with this?